Talk:Sequence: smallest number greater than previous term with exactly n divisors: Difference between revisions
Content added Content deleted
(→output for F#: added a new talk section.) |
Thundergnat (talk | contribs) (→output for F#: it's ''right'' there) |
||
| Line 11: | Line 11: | ||
== output for F# == |
== 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) |
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) |
||
:It is contained within the list of the first 58 terms directly after the task entry. You may need to scroll down a bit to see it. HTH --[[User:Thundergnat|Thundergnat]] ([[User talk:Thundergnat|talk]]) 23:48, 9 April 2019 (UTC) |
|||
Revision as of 23:49, 9 April 2019
OEIS A069654
the first 25 are:
1, 2, 4, 6, 16, 18, 64, 66, 100, 112, 1024, 1035, 4096, 4288, 4624, 4632, 65536, 65572, 262144, 262192, 263169, 269312, 4194304, 4194306
6765201 <-
But using the C-Version with MAX set to 28 the result is:
The first 28 anti-primes plus are:
1 2 4 6 16 18 64 66 100 112 1024 1035 4096 4288 4624 4632 65536 65572 262144 262192 263169 269312 4194304 4194306 4477456 4493312 4498641 4498752
completly different.
[1] 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? -- Gerard Schildberger (talk) 22:59, 9 April 2019 (UTC)
- It is contained within the list of the first 58 terms directly after the task entry. You may need to scroll down a bit to see it. HTH --Thundergnat (talk) 23:48, 9 April 2019 (UTC)