login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A086534
Smallest prime p sandwiched between two numbers that are divisible by n-th powers.
0
2, 17, 271, 1249, 13121, 13121, 153089, 1272833, 28146689, 193562623, 652963841, 1378557953, 29096394751, 316431663103, 2191221587969, 15356401156097, 128200797454337, 314394051346433, 314394051346433, 28344942091829249, 201993039632138239, 267803891553271807
OFFSET
1,1
COMMENTS
Conjecture: sequence is finite.
EXAMPLE
a(3) = 271, 270 = 3^3*10 and 272 = 2^3*34. 271 is the smallest such number.
a(4) = 1249, 1248 =2^4*78, 1250 = 5^4*2. 1250 is the smallest such number.
MATHEMATICA
PrimeExponents[n_] := Max[ Flatten[ Table[ # [[2]], {1}] & /@ FactorInteger[n]]]; NextPrim[n_] := Block[{k = n + 1}, While[ !PrimeQ[k], k++ ]; k]; a = Table[0, {15}]; p = 1; Do[p = NextPrim[p]; b = Min[ PrimeExponents[p - 1], PrimeExponents[p + 1]]; If[ a[[b]] == 0, a[[b]] = p; Print[b, " ", p]], {n, 1, 70000000}]; a
CROSSREFS
Sequence in context: A301584 A195443 A176585 * A198287 A338635 A268705
KEYWORD
nonn
AUTHOR
Amarnath Murthy, Aug 17 2003
EXTENSIONS
Edited and extended by Robert G. Wilson v, Aug 18 2003
a(5) corrected. a(13)-a(22) from Donovan Johnson, Sep 02 2008
STATUS
approved