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.

A078966 Primes p such that the differences between the 5 consecutive primes starting with p are (6,6,4,2).

This page as a plain text file.
%I A078966 #20 Feb 22 2025 03:36:18
%S A078966 601,2671,20341,24091,41941,42391,55201,65701,87541,125101,198811,
%T A078966 249421,355501,414691,416401,428551,510061,521161,541531,543871,
%U A078966 560221,603901,609601,637711,663961,669661,743161,770041,986131,1020961,1026661,1099711,1113181,1120501
%N A078966 Primes p such that the differences between the 5 consecutive primes starting with p are (6,6,4,2).
%C A078966 Equivalently, primes p such that p, p+6, p+12, p+16 and p+18 are consecutive primes.
%H A078966 Amiram Eldar, <a href="/A078966/b078966.txt">Table of n, a(n) for n = 1..10000</a>
%F A078966 a(n) == 1 (mod 30). - _Amiram Eldar_, Feb 22 2025
%e A078966 601 is in the sequence since 601, 607 = 601 + 6, 613 = 601 + 12, 617 = 601 + 16 and 619 = 601 + 18 are consecutive primes.
%t A078966 Transpose[Select[Partition[Prime[Range[81000]],5,1],Differences[#] == {6,6,4,2}&]][[1]] (* _Harvey P. Dale_, Sep 15 2011 *)
%o A078966 (PARI) list(lim) = {my(p1 = 2, p2 = 3, p3 = 5, p4 = 7); forprime(p5 = 11, lim, if(p2 - p1 == 6 && p3 - p2 == 6 && p4 - p3 == 4 && p5 - p4 == 2, print1(p1, ", ")); p1 = p2; p2 = p3; p3 = p4; p4 = p5);} \\ _Amiram Eldar_, Feb 22 2025
%Y A078966 Subsequence of A078858. - _R. J. Mathar_, May 06 2017
%Y A078966 Cf. A001223, A078866, A078867, A078946-A078971, A022006, A022007.
%K A078966 nonn
%O A078966 1,1
%A A078966 _Labos Elemer_, Dec 19 2002
%E A078966 Edited by _Dean Hickerson_, Dec 20 2002