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.

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

This page as a plain text file.
%I A215174 #26 Feb 06 2016 12:12:44
%S A215174 8,18,130,6890,254930,3352570,683351890,45139676530,2744959126130
%N A215174 a(n) is the least term of A214723 having n different prime divisors, or 0 if no such term exists.
%C A215174 Conjectures. 1) For every n, a(n)>0; 2) for n>=3, a(n)==0 (mod 10).
%C A215174 If 1) is true, then A215113 is unbounded.
%C A215174 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.
%Y A215174 Cf. A214723, A215113.
%K A215174 nonn,more
%O A215174 1,1
%A A215174 _Vladimir Shevelev_, _Zak Seidov_, _Robert G. Wilson v_, Aug 05 2012
%E A215174 a(9) from _Donovan Johnson_, Aug 19 2012