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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A221700 a(n) is the smallest prime p > n which cannot become prime by removing any number of initial digits in bases 2,...,n. 0
 5, 409, 409, 409, 9721, 47881, 47881, 47881, 10366201, 84768121, 35581939201, 45711198721, 5878291093921, 5878291093921, 5878291093921 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,1 COMMENTS The condition a(n) > n is introduced because 2 and 3 trivially satisfy the condition in every base b >= 2. LINKS EXAMPLE 409 = (110011001)_2 = (120011)_3 and none of the numbers (10011001)_2, (11001)_2, (1001)_2, (1)_2, (20011)_3, (11)_3, (1)_3 is prime. Since 409 is the smallest prime p > 3 with this property, a(3) = 409. MATHEMATICA mx[n_] := Block[{b = 2}, While[Not[Or @@ PrimeQ@Mod[n, b^Range@Floor@ Log[b, n]]], b++]; b-1]; c=1; n=5; While[n < 15^6, If[mx[n] > c, Print@{++c, n}, n = NextPrime@n]] CROSSREFS Cf. A196095, A211972. Sequence in context: A221047 A075769 A046274 * A216089 A201887 A301309 Adjacent sequences: A221697 A221698 A221699 * A221701 A221702 A221703 KEYWORD nonn,base,hard AUTHOR Giovanni Resta, Feb 22 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.

Last modified December 7 05:22 EST 2022. Contains 358649 sequences. (Running on oeis4.)