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.

A072848 Largest prime factor of 10^(6*n) + 1.

Original entry on oeis.org

9901, 99990001, 999999000001, 9999999900000001, 39526741, 3199044596370769, 4458192223320340849, 75118313082913, 59779577156334533866654838281, 100009999999899989999000000010001, 2361000305507449, 111994624258035614290513943330720125433979169
Offset: 1

Views

Author

Rick L. Shepherd, Jul 25 2002

Keywords

Comments

According to the link, there are only 18 "unique primes" below 10^50. The first four terms above are each unique primes, of periods 12, 24, 36 and 48, respectively, according to Caldwell and the cross-referenced sequences. These are precisely the only unique primes (less than 10^50 at least) with this type of digit pattern: m 9's, m-1 0's and 1, in that order. (Also a(10) is a unique prime of period 120.)

Examples

			10^(6*4)+1 = 17 * 5882353 * 9999999900000001, so a(4) = 9999999900000001, the largest prime factor.
		

Crossrefs

Cf. A040017 (unique period primes), A051627 (associated periods).

Programs

  • PARI
    for(n=1,12,v=factor(10^(6*n)+1); print1(v[matsize(v)[1],1],","))

Formula

a(n) = A003021(6n) = A006530(A062397(6n)). - Ray Chandler, May 11 2017