cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A228150 a(n) is the smallest n-digit prime which remains prime whenever a 9 is inserted, appended or prepended, or 0 if no such prime exists.

Original entry on oeis.org

7, 19, 199, 1009, 19417, 160009, 1086791, 10301299, 139993999, 1391909989, 10597399381, 108979916999, 1993999651909, 13924969999799
Offset: 1

Views

Author

Giovanni Resta, Aug 13 2013

Keywords

Comments

Smallest n-digit term of A215421.

Examples

			a(4) = 1009 is the smallest 4-digit prime which yields 5 primes by inserting a 9 in every possible position: 91009, 19009, 10909, 10099, 10099.
		

Crossrefs

Programs

  • 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, 9], Throw@p, p = NextPrime@p]]; 0]]; a /@ Range[8]