Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A065122
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A065122 a(1) = 2; a(n) is smallest prime > 10*a(n-1). +0
7
2, 23, 233, 2333, 23333, 233341, 2333459, 23334601, 233346041, 2333460413, 23334604169, 233346041759, 2333460417637, 23334604176379, 233346041763823, 2333460417638239, 23334604176382489, 233346041763824911 (list; graph; listen)
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} ]

PROGRAM

(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: A037757 A037645 A100893 this_sequence A127889 A088603 A048549

Adjacent sequences: A065119 A065120 A065121 this_sequence 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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 1 19:22 EST 2009. Contains 167811 sequences.


AT&T Labs Research