login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
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

%I #10 Jun 20 2015 14:47:32

%S 25,29,12,26,131,42,106,8,63

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

%C 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 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 Cf. A000040, A010888, A038194, A258876, A258877.

%K nonn,base,fini,full

%O 1,1

%A _Zak Seidov_, Jun 17 2015

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 19:02 EDT 2024. Contains 371798 sequences. (Running on oeis4.)