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.

A079018 Suppose p and q = p+16 are primes. Define the difference pattern of (p,q) to be the successive differences of the primes in the range p to q. There are 17 possible difference patterns, namely [16], [4,12], [6,10], [10,6], [12,4], [4,2,10], [4,6,6], [4,8,4], [6,4,6], [6,6,4], [10,2,4], [4,2,4,6], [4,2,6,4], [4,6,2,4], [6,4,2,4], [4,2,4,2,4], [2,2,4,2,4,2]. Sequence gives smallest value of p for each difference pattern, sorted by magnitude.

This page as a plain text file.
%I A079018 #3 Oct 15 2013 22:31:49
%S A079018 3,7,13,31,43,67,73,151,181,211,241,277,331,463,487,1597,1831
%N A079018 Suppose p and q = p+16 are primes. Define the difference pattern of (p,q) to be the successive differences of the primes in the range p to q. There are 17 possible difference patterns, namely [16], [4,12], [6,10], [10,6], [12,4], [4,2,10], [4,6,6], [4,8,4], [6,4,6], [6,6,4], [10,2,4], [4,2,4,6], [4,2,6,4], [4,6,2,4], [6,4,2,4], [4,2,4,2,4], [2,2,4,2,4,2]. Sequence gives smallest value of p for each difference pattern, sorted by magnitude.
%e A079018 p=181, q=197 has difference pattern [10,2,4] and {181,191,193,197} is the corresponding consecutive prime 4-tuple.
%Y A079018 A022008(1)=7, A078952(1)=13, A078852(1)=73, A078953(1)=67, A078954(1)=1597, A078961(1)=31, A078856(1)=73, A078858(1)=151, A031934(1)=A000230(8)=1831.
%Y A079018 Cf. A079016-A079024.
%K A079018 fini,full,nonn
%O A079018 1,1
%A A079018 _Labos Elemer_, Jan 24 2003