|
%I #6 Aug 18 2012 00:35:00
%S 3,59,9739,63353,209459,15596509,154858631,1794246731,4076149487,
%T 45603526979,11092303227413,93864728285579,1319833868136653
%N Smallest prime p congruent to 1 modulo prime(10^n).
%F a(n)=A035095(10^n).
%e a(0)=3 because p=prime(1)=2, 3=1+p
%e a(1)=59 because p=prime(10)=29, 59=1+2*p
%e a(2)=9739 because p=prime(10)=29, 59=1+18*p.
%t a[n_]:=(If[n<2,3,p=Prime[n];r=2p+1;While[!PrimeQ[r],r=r+2p];r]);Table[a[10^n],{n,0,12}]
%Y Cf. A035095.
%K nonn,more
%O 0,1
%A _Zak Seidov_, Aug 17 2012
|
