|
%I #6 Aug 28 2013 09:28:49
%S 11,2,101,1009,1000003,10000000019,100000000000000003,
%T 10000000000000000000000000331,
%U 10000000000000000000000000000000000000000000121,1000000000000000000000000000000000000000000000000000000000000000000000000129
%N Smallest prime with number of digits equal to n-th Lucas number A000032(n).
%C This is to Lucas numbers as A130150 is to Fibonacci numbers.
%F a(n) = A003617(A000032(n)) = (MIN{p(i) such that p(i) is prime and number of digits of decimal expansion of p(i) = L(n) for Lucas number L(n)} = MIN{A000040(i) such that A055642(A000040(i)) = A000032(n)}.
%e a(0) = 11 because L(0) = A000032(0) = 2 and 11 is the smallest 2 digit prime.
%e a(1) = 2 because L(1) = A000032(1) = 1 and 2 is the smallest 1 digit prime.
%e a(2) = 101 because L(2) = A000032(2) = 3 and 101 is the smallest 3 digit prime.
%t NextPrime/@(10^(LucasL[Range[0,10]]-1)) (* _Harvey P. Dale_, Aug 28 2013 *)
%Y Cf. A000032, A000040, A003617, A130150.
%K easy,nonn,base,less
%O 0,1
%A _Jonathan Vos Post_, Aug 04 2007
%E One more term (a(9)) from _Harvey P. Dale_, Aug 28 2013
| 