cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A156850 #10 Jan 22 2019 00:36:23
%S A156850 2,5,11,17,29,41,47,59,79,97,127,139,157,173,191,211,223,233,251,263,
%T A156850 277,307,331,347,367,389,419,439,457,479,503,521,541,557,577,599,631,
%U A156850 643,659,683,701,719,739,761,787,811,823,839,863,881,907,929,953,971
%N A156850 a(1)=2, a(n+1) is the smallest prime > (a(n) + sum of digits of a(n)).
%e A156850 2, 5(>4=2+2), 11(>10=5+5), 17(>13=11+1+1), 29(>25=17+1+7), etc.
%p A156850 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) ; # _R. J. Mathar_, Feb 20 2009
%t A156850 NestList[NextPrime[#+Total[IntegerDigits[#]]]&,2,60] (* _Harvey P. Dale_, Aug 21 2011 *)
%Y A156850 Cf. A000040, A156672.
%K A156850 nonn,base
%O A156850 1,1
%A A156850 _Juri-Stepan Gerasimov_, Feb 17 2009
%E A156850 Definition clarified by _Harvey P. Dale_, Aug 21 2011