Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A107108
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A107108 Shorthand of n-th - smallest n-digit prime, see comments. +0
1
2, 3, 107, 21, 61, 69, 117, 189, 193, 181, 259, 193, 303, 411, 487, 513, 931, 591 (list; graph; listen)
OFFSET

1,1

COMMENT

To shorthand the n-th - smallest n-digit prime it is convenient to distract the 10^(n-1) (n>1). Compare A107108(n) with A069100(n).

FORMULA

A107108(1)=2; at n>1 A107108(n)=prime(pi[10^(n-1)]+n)-10^(n-1)=A069100(n)-10^(n-1).

MATHEMATICA

A069100={2, 13, 107, 1021, 10061, 100069, 1000117, 10000189, 100000193, 1000000181, 10000000259, 100000000193, 1000000000303, 10000000000411, 100000000000487, 1000000000000513, 10000000000000931, 100000000000000591}; A107108=Flatten[{2, Table[A069100[[i]]-10^(i-1), {i, 2, 18}]}]

CROSSREFS

Cf. A069100.

Sequence in context: A041589 A039768 A097653 this_sequence A129729 A109349 A114373

Adjacent sequences: A107105 A107106 A107107 this_sequence A107109 A107110 A107111

KEYWORD

nonn,base

AUTHOR

Zak Seidov (zakseidov(AT)yahoo.com), May 12 2005

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 4 15:51 EST 2008. Contains 151308 sequences.


AT&T Labs Research