login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A127891 Smallest n-digit left-truncatable prime. 3

%I

%S 2,13,113,1223,12113,121283,1237547,12184967,124536947,1219861613,

%T 12181833347,121339693967,1213536676883,12673876537547,

%U 121848768729173,1275463876537547,12429121339693967,165678739293946997,1276812967623946997,15396334245663786197,315396334245663786197,5918918997653319693967,57686312646216567629137,357686312646216567629137

%N Smallest n-digit left-truncatable prime.

%C Ends at a(24) = 357686312646216567629137.

%C Agrees with A088604 for 24 terms, but this sequence ends there while A088604 continues.

%H Ray Chandler, <a href="/A127891/b127891.txt">Table of n, a(n) for n = 1..24</a>

%H I. O. Angell and H. J. Godwin, <a href="http://dx.doi.org/10.1090/S0025-5718-1977-0427213-2">On Truncatable Primes</a>, Math. Comput. 31, 265-267, 1977.

%H <a href="/index/Tri#tprime">Index entries for sequences related to truncatable primes</a>

%t grow[p_, digits_] := Select[ Table[ FromDigits[Join[{k}, IntegerDigits[p]]], {k, 1, 9}], PrimeQ[#] && Length[ IntegerDigits[#]] == digits&]; g[1] = {3, 7}; g[n_] := g[n] = grow[#, n]& /@ g[n-1] // Flatten; a[1] = 2; a[n_] := Min[g[n]]; Table[a[n], {n, 1, 24}] (* _Jean-Fran├žois Alcover_, Aug 05 2013 *)

%Y Cf. A024785, A050987, A088604, A127892.

%K base,nonn,fini,full

%O 1,1

%A _Ray Chandler_, Feb 04 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 2 09:56 EST 2021. Contains 341746 sequences. (Running on oeis4.)