|
Search: id:A130150
|
|
|
| A130150 |
|
Smallest prime with number of digits equal to n-th Fibonacci number. |
|
+0
2
|
|
| 2, 11, 101, 10007, 10000019, 1000000000039, 100000000000000000039, 1000000000000000000000000000000061, 1000000000000000000000000000000000000000000000000000031, 10000000000000000000000000000000000000000000000000000000000000000000000000000000\ 000000181
(list; graph; listen)
|
|
|
OFFSET
|
2,1
|
|
|
MAPLE
|
A130150 := proc(n) ndgs := combinat[fibonacci](n) ; nextprime(10^(ndgs-1)) ; end: seq(A130150(n), n=2..11) ; - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 15 2007
|
|
CROSSREFS
|
Sequence in context: A099701 A089393 A069664 this_sequence A115941 A024721 A081716
Adjacent sequences: A130147 A130148 A130149 this_sequence A130151 A130152 A130153
|
|
KEYWORD
|
easy,nonn,base
|
|
AUTHOR
|
Giovanni Teofilatto (g.teofilatto(AT)tiscalinet.it), Aug 03 2007
|
|
EXTENSIONS
|
More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 15 2007
|
|
|
Search completed in 0.002 seconds
|
