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.

A259028 a(n) = least number m such that digital root of m is n*(digital root of m-th prime).

Original entry on oeis.org

25, 29, 12, 26, 131, 42, 106, 8, 63
Offset: 1

Views

Author

Zak Seidov, Jun 17 2015

Keywords

Comments

Corresponding pairs of m and prime(m): {25,97}, {29,109}, {12,37}, {26, 101}, {131,739}, {42,181}, {106,577}, {8,19}, {63,307}.

Crossrefs

Programs

  • Mathematica
    Table[m = 1; While[FixedPoint[Total@ IntegerDigits[#] &, m] != n FixedPoint[Total@ IntegerDigits[#] &, Prime@ m], m++]; m, {n, 9}] (* Michael De Vlieger, Jun 19 2015 *)