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.

A053706 Primes p such that between p and the next prime, 2 prime powers (A025475) occur.

This page as a plain text file.
%I A053706 #28 Jul 02 2025 16:01:59
%S A053706 7,23,113,2179,32749
%N A053706 Primes p such that between p and the next prime, 2 prime powers (A025475) occur.
%C A053706 No other terms < 4290000000. - _Jud McCranie_, Jun 20 2000
%C A053706 There are no other terms < 2^63. - _Donovan Johnson_, Mar 11 2013
%e A053706 Between 7 and 11 the 2 prime powers are 8 and 9, between 23 and 29 the 2 prime powers are 25 and 27, between 113 and 127 the 2 prime powers are 121 and 125, while between 32749 and 32771 the 2 prime powers are 32761 = 181^2 and 32768 = 2^15.
%t A053706 nn = 2^20; Prime /@ Keys@ Select[PositionIndex[PrimePi /@ Union@ Flatten@ Table[Array[p^# &, Floor@ Log[p, nn] - 1, 2], {p, Prime@ Range@ PrimePi@ Sqrt@ nn}]], Length[#] > 1 &] (* _Michael De Vlieger_, Mar 21 2024 *)
%o A053706 (PARI) isok(p) = isprime(p) && (q=nextprime(p+1)) && (v=vector(q-p, x, p+x)) && (#select(x->(isprimepower(x) && !isprime(x)), v) == 2);
%o A053706 lista(nn) = forprime(p=2, nn, if (isok(p), print1(p, ", "))); \\ _Michel Marcus_, Jul 15 2017
%Y A053706 Cf. A025475, A053607.
%K A053706 hard,more,nonn
%O A053706 1,1
%A A053706 _Labos Elemer_, Feb 14 2000
%E A053706 Corrected by _James Sellers_, Feb 22 2000