|
|
A079482
|
|
Smallest number k such that k and k+1 have n and n+1 distinct prime divisors.
|
|
1
|
|
|
1, 5, 65, 1364, 40754, 1774409, 58524465, 5327923964, 555409903685, 70367042561529, 5819629108725509, 567969628457303709
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
LINKS
|
|
|
EXAMPLE
|
a(3) = 1364 because 1364 has 3 and 1365 has 4 distinct prime divisors.
|
|
MATHEMATICA
|
a[n_] := Module[{k = 1}, While[PrimeNu[k] != n || PrimeNu[k + 1] != n + 1, k++]; k]; Array[a, 10, 0] (* Amiram Eldar, Dec 03 2018 *)
|
|
PROG
|
(PARI) for(n=1, 10, k=1; while(omega(k)!=n || omega(k+1)!=n+1, k++); print1(k", "))
|
|
CROSSREFS
|
|
|
KEYWORD
|
more,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|