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.

A086149 Primes p such that p + 32 is also prime and there are seven primes between p and p + 32.

This page as a plain text file.
%I A086149 #27 Aug 16 2024 06:07:11
%S A086149 29,41,416387,626597,6560987,6937937,25658429,25658441,29597411,
%T A086149 49136357,51448361,57405419,90279461,128469149,137943341,162189089,
%U A086149 165531251,175182587,227779679,261672779,290973491,294536141,311725847,334388279,422005247,442768631,503804657
%N A086149 Primes p such that p + 32 is also prime and there are seven primes between p and p + 32.
%H A086149 Amiram Eldar, <a href="/A086149/b086149.txt">Table of n, a(n) for n = 1..1000</a>
%t A086149 cp[x_, y_] := Count[Table[PrimeQ[i], {i, x, y}], True] Do[s=Prime[n]; s1=Prime[n+1]; If[PrimeQ[s+32]&& Equal[cp[s+1, s+d-1], 7], Print[s]], {n, 1, 1000000}]
%t A086149 Select[Partition[Prime[Range[98*10^5]],9,1],Last[#]-First[#]==32&] [[All,1]] (* _Harvey P. Dale_, Sep 12 2017 *)
%o A086149 (PARI) lista(pmax) = {my(ps = primes(9)); forprime(p = prime(10), pmax, ps = concat(vecextract(ps, "^1"), p); if(ps[9] - ps[1] == 32, print1(ps[1], ", ")));} \\ _Amiram Eldar_, Aug 15 2024
%Y A086149 Subsequence of A049489.
%K A086149 nonn
%O A086149 1,1
%A A086149 _Labos Elemer_, Jul 29 2003
%E A086149 Definition clarified by _Harvey P. Dale_, Sep 12 2017
%E A086149 a(19)-a(27) from _Amiram Eldar_, Aug 15 2024