login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A065122 a(1) = 2; a(n) is smallest prime > 10*a(n-1). 8
2, 23, 233, 2333, 23333, 233341, 2333459, 23334601, 233346041, 2333460413, 23334604169, 233346041759, 2333460417637, 23334604176379, 233346041763823, 2333460417638239, 23334604176382489, 233346041763824911 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

LINKS

Harry J. Smith, Table of n, a(n) for n=1,...,100

MATHEMATICA

NextPrim[n_Integer] := Block[ {k = n + 1}, While[ !PrimeQ[k], k++ ]; Return[k]]; a[1] = 2; a[n_] := NextPrim[ 10*a[n - 1]]; Table[ a[n], {n, 1, 20} ]

PROG

(PARI) { for (n=1, 100, if (n>1, a=nextprime(10*a), a=2); write("b065122.txt", n, " ", a) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Oct 10 2009]

CROSSREFS

Cf. A024770, A055496

Sequence in context: A037645 A100893 A198972 * A127889 A088603 A048549

Adjacent sequences:  A065119 A065120 A065121 * A065123 A065124 A065125

KEYWORD

nonn

AUTHOR

Henry Bottomley (se16(AT)btinternet.com), Nov 13 2001

EXTENSIONS

More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Nov 28 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 14:50 EST 2012. Contains 206050 sequences.