cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-1 of 1 results.

A215174 a(n) is the least term of A214723 having n different prime divisors, or 0 if no such term exists.

Original entry on oeis.org

8, 18, 130, 6890, 254930, 3352570, 683351890, 45139676530, 2744959126130
Offset: 1

Views

Author

Vladimir Shevelev, Zak Seidov, Robert G. Wilson v, Aug 05 2012

Keywords

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.

Crossrefs

Cf. A214723, A215113.

Extensions

a(9) from Donovan Johnson, Aug 19 2012
Showing 1-1 of 1 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.