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 13:43, 13 April 2019
, 5 years ago→Which integer sequence is meant output for F#
Thundergnat (talk | contribs) m (Thundergnat moved page Talk:Anti-primes Plus to Talk:Sequence: smallest number greater than previous term with exactly n divisors: Named to more accuratly reflect what the task is) |
|||
| (One intermediate revision by one other user not shown) | |||
Line 1:
{{Alertbox|pink|For future readers: This task was renamed from "Anti-Primes Plus" and split into multiple tasks. Any reference to anti-primes plus is a remnant from before the rename.}}
== OEIS A069654 ==
the first 25 are:
Line 28 ⟶ 29:
:::::::: Perhaps we should have two tasks: A005179 Smallest number with exactly n divisors; and A069654 a(1) = 1; for n > 1, a(n) = smallest number > a(n-1) having exactly n divisors. <br> If we can only have one I would favour A005179 for its number theoretic interest. Why does the sequence have spikes at prime n? Anyone proposing this task should be able to answer this question!!!! --[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 16:20, 10 April 2019 (UTC)
::::::::: Already said in [[Anti-primes_Plus#Pascal|Pascal]]. waitung for CalmoSoft :-) -- [[User:Horsth|Horsth]]
:::::::::: I'm sure that why the sequence has spikes at prime n hasn't been adequately said! I've now had my say at http://www.rosettacode.org/wiki/Talk:Sequence:_smallest_number_with_exactly_n_divisors.
== Rename and split ==
Line 35 ⟶ 37:
I propose to rename this task and add two other tasks. Since most people (including the original author) seemed to interpret this task as [[oeis:A069654|OEIS:A069654]], this task will become that. (smallest number of examples that will need to be moved/modified)
:*(this task) Sequence: smallest number greater than previous term with exactly n divisors ([[oeis:A069654|OEIS:A069654]])
:*(new task) Sequence: smallest number with exactly n divisors ([[oeis:A005179|OEIS:A005179]])
:*(new task) Sequence: nth number with exactly n divisors ([[oeis:A073916|OEIS:A073916]])
if you have a suggestion for a better/shorter name for any of these that is descriptive enough to be able to tell essentially what the task is asking for, please share it. --[[User:Thundergnat|Thundergnat]] ([[User talk:Thundergnat|talk]]) 15:16, 11 April 2019 (UTC)
| |||