login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A158054
a(1)=2, a(n+1) is the smallest prime > n*(sum of decimal digits of a(n)).
1
2, 3, 7, 23, 23, 29, 67, 97, 131, 47, 113, 59, 173, 149, 197, 257, 227, 191, 199, 367, 331, 149, 311, 127, 241, 179, 443, 307, 281, 331, 211, 127, 331, 233, 277, 563, 509, 521, 307, 397, 761, 577, 809, 733, 577, 857, 929, 941, 673, 787, 1103, 257, 733, 691, 877
OFFSET
1,1
EXAMPLE
a(1)=2;
a(2)=3 > 2 = 1*2;
a(3)=7 > 6 = 2*3;
a(4)=23 > 21 = 3*7;
a(5)=23 > 20 = 4*(2+3);
a(6)=29 > 25 = 5*(2+3);
a(7)=67 > 66 = 6*(2+9);
a(8)=97 > 91 = 7*(6+7);
a(9)=131 > 128 = 8*(9+7);
a(10)=47 > 45 = 9*(1+3+1).
MAPLE
A007953 := proc(n) add(d, d=convert(n, base, 10)) ; end proc: A158054 := proc() option remember; if n = 1 then 2; else (n-1)*A007953(procname(n-1)) ; nextprime(%) ; end if; end proc: seq(A158054(n), n=1..120) ; # R. J. Mathar, May 19 2010
CROSSREFS
KEYWORD
nonn,base,easy
AUTHOR
EXTENSIONS
Corrected (193 replaced by 199, all terms from a(32) on replaced) by R. J. Mathar, May 19 2010
Edited by Jon E. Schoenfield, Feb 17 2019
STATUS
approved