The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A259028 a(n) = least number m such that digital root of m is n*(digital root of m-th prime). 0
 25, 29, 12, 26, 131, 42, 106, 8, 63 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 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}. LINKS 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 *) CROSSREFS Cf. A000040, A010888, A038194, A258876, A258877. Sequence in context: A195613 A127652 A303812 * A317392 A234640 A219258 Adjacent sequences:  A259025 A259026 A259027 * A259029 A259030 A259031 KEYWORD nonn,base,fini,full AUTHOR Zak Seidov, Jun 17 2015 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified March 28 15:12 EDT 2020. Contains 333089 sequences. (Running on oeis4.)