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).

This page as a plain text file.
%I A259028 #10 Jun 20 2015 14:47:32
%S A259028 25,29,12,26,131,42,106,8,63
%N A259028 a(n) = least number m such that digital root of m is n*(digital root of m-th prime).
%C A259028 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}.
%t A259028 Table[m = 1; While[FixedPoint[Total@ IntegerDigits[#] &, m] != n FixedPoint[Total@ IntegerDigits[#] &, Prime@ m], m++]; m, {n, 9}] (* _Michael De Vlieger_, Jun 19 2015 *)
%Y A259028 Cf. A000040, A010888, A038194, A258876, A258877.
%K A259028 nonn,base,fini,full
%O A259028 1,1
%A A259028 _Zak Seidov_, Jun 17 2015