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.

A138960 a(n) = smallest prime divisor of A138957(n).

Original entry on oeis.org

1, 2, 3, 2, 3, 2, 127, 2, 3, 857, 3, 3, 18503, 3, 3, 43, 3, 3, 17, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 7, 3, 3, 1051, 3, 3, 67103, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 5, 3, 3, 5, 3, 3, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2
Offset: 1

Views

Author

Artur Jasinski, Apr 04 2008

Keywords

Comments

For largest prime divisors see A138961.

Crossrefs

Programs

  • Mathematica
    a = {}; b = {}; Do[w = RealDigits[n]; w = First[w]; Do[AppendTo[a, w[[Length[w] - k + 1]]], {k, 1, Length[w]}]; p = FromDigits[a]; AppendTo[b, First[First[FactorInteger[p]]]], {n, 1, 38}]; b
    A137957[n_] := FromDigits[Flatten[Reverse /@ IntegerDigits[Range[n]]]];
    Table[FactorInteger[A137957[n]][[1, 1]], {n, 39}] (* Robert Price, May 10 2019 *)

Extensions

a(39)-a(69) from Robert Price, May 10 2019