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

%I #4 Mar 30 2012 18:52:32

%S 2,5,11,13,17,29,41,47,59,73,83,97,113,127,137,149,163,173,191,211,

%T 223,233,241,251,263,277,293,307,317,331,347,367,383,397,419,433,443,

%U 457,479,499,521,541,557,577,599,631,641,653,673,691,709,727,743,757,787

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

%C Heuristically, a(n) ~ kn log n for some k >= 4.5/log 10.

%e 2, 5(>4=2+2), 11(>10>5+5), 13(=13=11+1+1), 17(=17=13+1+3), 29(>25=17+1+7), etc.

%Y Cf. A156604.

%K nonn,base,less

%O 1,1

%A _Juri-Stepan Gerasimov_, Feb 13 2009

%E Corrected by _Charles R Greathouse IV_, Mar 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 24 11:01 EDT 2024. Contains 371936 sequences. (Running on oeis4.)