Anonymous user
Talk:Sequence: smallest number greater than previous term with exactly n divisors: Difference between revisions
Talk:Sequence: smallest number greater than previous term with exactly n divisors (view source)
Revision as of 22:59, 9 April 2019
, 5 years ago→output for F#: added a new talk section.
(Is OEIS A069654 correct?) |
(→output for F#: added a new talk section.) |
||
Line 8:
completly different.
[https://www.nayuki.io/page/calculate-divisors-javascript] 4477456 = 2^4 × 23^4 got 25 divisors like 6765201 =3^4*17^4
== output for F# ==
I don't understand the output of the '''#F''' entry. Where is the list of the first '''15''' numbers of the ''anti-prime plus'' sequence? -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 22:59, 9 April 2019 (UTC)
| |||