|
|
A048932
|
|
Let d(n) = number of distinct primes dividing n (A001221). Find smallest t such that d(t)=d(t+1)=...=d(t+n-1) but d(t-1) and d(t+n) are not = d(t); then a(n)=t.
|
|
6
|
|
|
1, 14, 7, 2, 54, 91, 323, 141, 44360, 48919, 218972, 534078, 2699915, 526095, 17233173, 127890362, 29138958036, 146216247221, 118968284928
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
a(n) > 10^13 for n from 20 to 22. a(23) = 585927201062. [From Donovan Johnson, Jul 30 2010]
|
|
LINKS
|
|
|
EXAMPLE
|
a(3)=7 since 7,8,9 all have d = 1 but d(6) and d(10) != 1 and this is the first run of 3.
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|