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!)
A158059 a(1)=2, a(n+1) is the smallest prime >= n*sum of digits of a(n). 0

%I #5 Mar 31 2012 21:08:17

%S 2,2,5,17,37,53,53,59,113,47,113,59,173,149,197,257,227,191,199,367,

%T 331,149,311,127,241,179,443,307,281,331,211,127,331,233,277,563,509,

%U 521,307,397,761,577,809,733,577,857,929,941,673,787,1103,257,733,691,877

%N a(1)=2, a(n+1) is the smallest prime >= n*sum of digits of a(n).

%e 2, 2(=2=1*2), 5(>4=2*2), 17(>15=3*5), 37(>32=4*1+4*7), 53(>50=5*3+5*7), 53(>48=6*5+6*3), 59(>56=7*5+7*3), 113(>112=8*5+8*9), 47(>45=9*1+9*1+9*3)

%Y Cf. A000027, A000040, A156615.

%K nonn,base,less

%O 1,1

%A _Juri-Stepan Gerasimov_, Mar 12 2009

%E a(49) and terms from a(53) on corrected by _R. J. Mathar_, May 19 2010

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 08:28 EDT 2024. Contains 371782 sequences. (Running on oeis4.)