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.

A067063 Smallest prime factor of repunit(n) = (10^n-1)/9 (A002275).

Original entry on oeis.org

11, 3, 11, 41, 3, 239, 11, 3, 11, 21649, 3, 53, 11, 3, 11, 2071723, 3, 1111111111111111111, 11, 3, 11, 11111111111111111111111, 3, 41, 11, 3, 11, 3191, 3, 2791, 11, 3, 11, 41, 3, 2028119, 11, 3, 11, 83, 3, 173, 11, 3, 11, 35121409, 3, 239
Offset: 2

Views

Author

Amarnath Murthy, Jan 03 2002

Keywords

Comments

a(n) = A003020(n) = R_(n) iff n is a term of A004023. - Bernard Schott, May 22 2022

References

  • David Wells, The Penguin Dictionary of Curious and Interesting Numbers.

Crossrefs

Largest factor: A003020.

Programs

  • Maple
    'min(op(numtheory[factorset]((10^k-1)/9)))'$k=2..50; # M. F. Hasler, Nov 21 2006
  • Mathematica
    a = {}; Do[a = Append[a, FactorInteger[(10^n - 1)/9][[1, 1]]], {n, 2, 111} ]; a
    Table[FactorInteger[FromDigits[PadRight[{},n,1]]][[1,1]],{n,2,50}] (* Harvey P. Dale, Dec 10 2013 *)

Formula

a(3n) = 3, a(6n-4) = a(6n-2) = 11, a(30n-25) = a(30n-5) = 41, ... - M. F. Hasler, Nov 21 2006
a(n) = A020639(A002275(n)). - Ray Chandler, Apr 22 2017

Extensions

More terms from Robert G. Wilson v, Jan 04 2002