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.

A274045 Primes p such that p + 72 is the next prime.

This page as a plain text file.
%I A274045 #16 Feb 09 2025 17:21:36
%S A274045 31397,360091,507217,517639,633667,650107,705317,749471,753859,770669,
%T A274045 809629,818021,828277,1001839,1025957,1087159,1133387,1145899,1152421,
%U A274045 1164101,1206869,1207769,1210639,1241087,1278911,1290719,1351997
%N A274045 Primes p such that p + 72 is the next prime.
%C A274045 This sequence is a subsequence of A156105 (p and p + 72 are primes).
%H A274045 Karl V. Keller, Jr., <a href="/A274045/b274045.txt">Table of n, a(n) for n = 1..10000</a>
%e A274045 For 31397, the next prime is 31397 + 72 = 31469.
%e A274045 For 360091, the next prime is 360091 + 72 = 360163.
%t A274045 Select[Partition[Prime[Range[105000]],2,1],#[[2]]-#[[1]]==72&][[All,1]] (* _Harvey P. Dale_, Dec 19 2021 *)
%o A274045 (Python)
%o A274045 from sympy import isprime,nextprime
%o A274045 for i in range(3,1500001,2):
%o A274045   if isprime(i) and nextprime(i) == i+72: print(i,end=', ')
%o A274045 (PARI) is(n)=isprime(n) && nextprime(n+1)-n==72 \\ _Charles R Greathouse IV_, Jun 19 2016
%Y A274045 Cf. A000040, A204792.
%K A274045 nonn
%O A274045 1,1
%A A274045 _Karl V. Keller, Jr._, Jun 07 2016