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.

A189888 a(n) = A139602(m) such that for any k>m, A139602(k) > A139602(m).

Original entry on oeis.org

11, 19, 43, 97, 163, 191, 223, 457, 877, 1049, 1307, 1987, 2029, 2129, 4217, 6599, 9967, 10357, 18233, 66343, 74573, 95911, 99719, 186551, 196337, 211219, 262469, 277301, 416573, 603487, 994549, 1403137, 4117441, 4805761, 4895789, 5823067, 5842813, 7704409
Offset: 1

Views

Author

Lei Zhou, Apr 30 2011

Keywords

Comments

Dickson's conjecture implies that this sequence is infinite. - Charles R Greathouse IV, Mar 22 2011

Examples

			For n=1, a(n)=A139602(1)=11;
A139602(3)=61 is skipped since A139602(4)=43 < A139602(3), thus a(3)=A139602(4)=43;
For the same reason, A139602(8) and A139602(9) are skipped so that a(7)=A139602(10)=223.
		

Crossrefs

Cf. A139602.

Programs

  • Mathematica
    count=0; imin=0; cstop=65; pn=4; While[countimin,imin=i; count++]]