The OEIS is supported by the many generous donors to the OEIS Foundation.

 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 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A287353 a(0)=0; for n>0, a(n) = 10*a(n-1) + prime(n). 3
 0, 2, 23, 235, 2357, 23581, 235823, 2358247, 23582489, 235824913, 2358249159, 23582491621, 235824916247, 2358249162511, 23582491625153, 235824916251577, 2358249162515823, 23582491625158289 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS Michael De Vlieger, Table of n, a(n) for n = 0..1000 MATHEMATICA FoldList[10 #1 + Prime@ #2 &, 0, Range@ 17] (* Michael De Vlieger, May 24 2017 *) PROG (Python) from sympy import prime l = [0] for i in range(20): l += [10 * l[i] + prime(i + 1)] print(l) # Indranil Ghosh, May 25 2017 (PARI) a(n) = fromdigits(primes(n)); \\ Kevin Ryde, Jun 22 2022 CROSSREFS Cf. A014824, A019518, A092844, A110299. Sequence in context: A294268 A118385 A098739 * A091762 A309706 A240959 Adjacent sequences: A287350 A287351 A287352 * A287354 A287355 A287356 KEYWORD nonn,easy AUTHOR Luke Zieroth, May 23 2017 STATUS approved

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.

Last modified December 4 14:48 EST 2023. Contains 367563 sequences. (Running on oeis4.)