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.

A078849 Initial term in sequence of four consecutive primes separated by 3 consecutive differences each <=6 (i.e., when d=2,4 or 6) and forming d-pattern=[2, 6,6]; short d-string notation of pattern = [266].

This page as a plain text file.
%I A078849 #18 Dec 29 2017 18:11:53
%S A078849 149,599,3299,4649,5099,6359,11489,12539,16979,19469,27059,30089,
%T A078849 31319,34259,42179,53609,58229,63689,65699,71339,75209,77549,78569,
%U A078849 80909,81929,85829,87509,87539,89519,92219,101279,105359,112289,116099,116789
%N A078849 Initial term in sequence of four consecutive primes separated by 3 consecutive differences each <=6 (i.e., when d=2,4 or 6) and forming d-pattern=[2, 6,6]; short d-string notation of pattern = [266].
%C A078849 Subsequence of A049437. - _R. J. Mathar_, Feb 10 2013
%H A078849 R. J. Mathar, <a href="/A078849/b078849.txt">Table of n, a(n) for n = 1..1000</a>
%F A078849 Primes p = p(i) such that p(i+1)=p+2, p(i+2)=p+2+6, p(i+3)=p+2+6+6.
%e A078849 149, 149+2=151, 149+2+6=157, 149+2+6+6=163 are consecutive primes.
%t A078849 d = {2, 6, 6}; First /@ Select[Partition[Prime@ Range@ 12000, Length@ d + 1, 1], Differences@ # == d &] (* _Michael De Vlieger_, May 02 2016 *)
%t A078849 Select[Partition[Prime[Range[12000]],4,1],Differences[#]=={2,6,6}&][[All,1]] (* _Harvey P. Dale_, Dec 29 2017 *)
%Y A078849 Cf. analogous prime quadruple sequences with various possible {2, 4, 6}-difference-patterns in brackets: A007530[242], A078847[246], A078848[264], A078849[266], A052378[424], A078850[426], A078851[462], A078852[466], A078853[624], A078854[626], A078855[642], A078856[646], A078857[662], A078858[664], A033451[666].
%K A078849 nonn
%O A078849 1,1
%A A078849 _Labos Elemer_, Dec 11 2002
%E A078849 Listed terms verified by _Ray Chandler_, Apr 20 2009