login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A228149 a(n) is the smallest n-digit prime which remains prime whenever a 7 is inserted, appended or prepended, or 0 if no such prime exists. 2
3, 19, 433, 1471, 13177, 175687, 1740787, 10871017, 137725897, 1670181787, 12845952529, 117777772309, 1008078796477, 11777787780727 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Smallest n-digit term of A215420.
LINKS
EXAMPLE
a(3) = 433 is the smallest 3-digit prime which yields 4 primes by inserting a 7 in every possible position: 7433, 4733, 4373, 4337.
MATHEMATICA
pp[n_, k_] := Catch[Block[{d = IntegerDigits@n}, Do[If[! PrimeQ[ FromDigits[ Insert[d, k, i]]], Throw[False]], {i, 1+Length@d}]; True]]; a[n_] := Catch[ Block[{p = NextPrime[10^(n-1)]}, While[p < 10^n, If[pp[p, 7], Throw@p, p = NextPrime@p]]; 0]]; a /@ Range[8]
CROSSREFS
Sequence in context: A041951 A365362 A143762 * A358161 A079281 A176232
KEYWORD
nonn,base,more
AUTHOR
Giovanni Resta, Aug 13 2013
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 17 22:23 EDT 2024. Contains 371767 sequences. (Running on oeis4.)