|
|
A215174
|
|
a(n) is the least term of A214723 having n different prime divisors, or 0 if no such term exists.
|
|
0
|
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Conjectures. 1) For every n, a(n)>0; 2) for n>=3, a(n)==0 (mod 10).
If 1) is true, then A215113 is unbounded.
The corresponding positions m=m(n) such that A214723(m)=a(n) are 1,3,12,132,2074,18625,2138668. m(8) exists and the calculations show that it is >= 24866450, although up to now the exact its value is unknown.
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|