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.

A083808 Smallest prime == 1 (mod n-th unary number U(n) = (10^n-1)/9).

Original entry on oeis.org

2, 23, 223, 24443, 199999, 666667, 19999999, 22222223, 666666667, 44444444441, 22222222223, 2444444444443, 17777777777777, 88888888888889, 1333333333333333, 64444444444444439, 88888888888888889
Offset: 1

Views

Author

Amarnath Murthy and Meenakshi Srikanth (menakan_s(AT)yahoo.com), May 08 2003

Keywords

Examples

			a(4) = 24443 ==1 (mod 1111).
		

Crossrefs

Cf. A000042.

Programs

  • Maple
    with(numtheory): for n from 1 to 30 do u := (10^n-1)/9: for j from u+1 to 1000*u+1 by u do if isprime(j) then printf(`%d,`,j); break; fi: od:od:

Extensions

Corrected and extended by James Sellers, May 19 2003