|
|
A130217
|
|
Smallest prime with number of digits equal to n-th Lucas number A000032(n).
|
|
0
|
|
|
11, 2, 101, 1009, 1000003, 10000000019, 100000000000000003, 10000000000000000000000000331, 10000000000000000000000000000000000000000000121, 1000000000000000000000000000000000000000000000000000000000000000000000000129
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
COMMENTS
|
This is to Lucas numbers as A130150 is to Fibonacci numbers.
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
a(0) = 11 because L(0) = A000032(0) = 2 and 11 is the smallest 2 digit prime.
a(1) = 2 because L(1) = A000032(1) = 1 and 2 is the smallest 1 digit prime.
a(2) = 101 because L(2) = A000032(2) = 3 and 101 is the smallest 3 digit prime.
|
|
MATHEMATICA
|
NextPrime/@(10^(LucasL[Range[0, 10]]-1)) (* Harvey P. Dale, Aug 28 2013 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn,base,less
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|