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 00:31, 10 April 2019
, 5 years ago→output for F#: Not sure where "Anti-primes plus" came from
m (→output for F#: corrected spelling of the F# language.) |
Thundergnat (talk | contribs) (→output for F#: Not sure where "Anti-primes plus" came from) |
||
Line 17:
:: Never mind, I see that '''F#''' is computing a "different" sequence. -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 00:16, 10 April 2019 (UTC)
::: For what it's worth, the term "The Anti-primes plus sequence" doesn't seem to exist anywhere on the web except here, so I wouldn't get to hung up on what is '''the''' correct sequence. The task description is extremely vague. Most people seemed to interpret it as [[oeis:A069654|OEIS: A069654]], but [[oeis:A005179|OEIS: A005179]] is also a valid sequence that fits the description. I also included two other "sequences" in the Perl 6 entry that technically satisfy the requirements. --[[User:Thundergnat|Thundergnat]] ([[User talk:Thundergnat|talk]]) 00:30, 10 April 2019 (UTC)
| |||