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.

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

This page as a plain text file.
%I A078968 #16 Feb 22 2025 03:35:24
%S A078968 251,17471,56081,75521,94421,115751,121001,154061,163841,179801,
%T A078968 185051,250031,344231,351041,380441,417941,517061,683681,703211,
%U A078968 713171,783131,849581,916451,983771,1003091,1025261,1055591,1070411,1115561,1129841,1260881,1517921,1565171
%N A078968 Primes p such that the differences between the 5 consecutive primes starting with p are (6,6,6,2).
%C A078968 Equivalently, primes p such that p, p+6, p+12, p+18 and p+20 are consecutive primes.
%H A078968 Amiram Eldar, <a href="/A078968/b078968.txt">Table of n, a(n) for n = 1..10000</a>
%F A078968 a(n) == 11 (mod 30). - _Amiram Eldar_, Feb 22 2025
%e A078968 251 is in the sequence since 251, 257 = 251 + 6, 263 = 251 + 12, 269 = 251 + 18 and 271 = 251 + 20 are consecutive primes.
%t A078968 Select[Partition[Prime[Range[150000]], 5, 1], Differences[#] == {6,6,6,2} &][[;;, 1]] (* _Amiram Eldar_, Feb 22 2025 *)
%o A078968 (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 == 6 && p5 - p4 == 2, print1(p1, ", ")); p1 = p2; p2 = p3; p3 = p4; p4 = p5);} \\ _Amiram Eldar_, Feb 22 2025
%Y A078968 Subsequence of A033451. - _R. J. Mathar_, May 06 2017
%Y A078968 Cf. A001223, A078866, A078867, A078946-A078971, A022006, A022007.
%K A078968 nonn
%O A078968 1,1
%A A078968 _Labos Elemer_, Dec 19 2002
%E A078968 Edited by _Dean Hickerson_, Dec 20 2002