|
Search: id:A156850
|
|
|
| A156850 |
|
a(1)=2, a(n+1) is the smallest prime > a(n) + sum of digits of a(n). |
|
+0
1
|
|
| 2, 5, 11, 17, 29, 41, 47, 59, 79, 97, 127, 139, 157, 173, 191, 211, 223, 233, 251, 263, 277, 307, 331, 347, 367, 389, 419, 439, 457, 479, 503, 521, 541, 557, 577, 599, 631, 643, 659, 683, 701, 719, 739, 761, 787, 811, 823, 839, 863, 881, 907, 929, 953, 971
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
EXAMPLE
|
2, 5(>4=2+2), 11(>10=5+5), 17(>13=11+1+1), 29(>25=17+1+7), etc.
|
|
MAPLE
|
A007953 := proc(n) add(d, d=convert(n, base, 10)) ; end: A156850 := proc(n) option remember; if n = 1 then 2; else procname(n-1)+A007953(procname(n-1)) ; nextprime(%) ; fi; end: seq(A156850(n), n=1..120) ; [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 20 2009]
|
|
CROSSREFS
|
Cf. A000040, A156672.
Adjacent sequences: A156847 A156848 A156849 this_sequence A156851 A156852 A156853
Sequence in context: A023222 A007491 A124850 this_sequence A156611 A143509 A111166
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Juri-Stepan Gerasimov (2stepan(AT)rambler.ru), Feb 17 2009
|
|
|
Search completed in 0.002 seconds
|
