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.

A227346 Distance between consecutive pairs of primes differing by 6 (p, p+6).

This page as a plain text file.
%I A227346 #32 Feb 16 2025 08:33:20
%S A227346 2,4,2,4,6,8,6,4,6,6,8,6,6,10,14,4,2,4,24,20,6,10,6,18,2,30,4,6,18,6,
%T A227346 6,8,6,30,4,20,16,6,14,6,10,50,10,14,4,42,38,16,6,8,16,6,8,6,6,28,6,6,
%U A227346 24,50,6,18,70,2,30,4,20,4,60,6,24,6,14,22,20,30
%N A227346 Distance between consecutive pairs of primes differing by 6 (p, p+6).
%H A227346 Vincenzo Librandi, <a href="/A227346/b227346.txt">Table of n, a(n) for n = 1..1000</a>
%H A227346 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/SexyPrimes.html">Sexy Primes</a>. [The definition in this webpage is unsatisfactory, because it defines a "sexy prime" as a pair of primes.- _N. J. A. Sloane_, Mar 07 2021]
%H A227346 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/PrimeConstellation.html">Prime Constellation</a>
%F A227346 a(n) = A023201(n+1) - A023201(n). - _Zak Seidov_, Sep 20 2013
%p A227346 with(numtheory): pre:=0: for n from 1 to 3000 do if isprime(n) and isprime(n+6) then if pre<>0 then printf("%d, ", n-pre) fi: pre:=n fi od: # adapted from original program by C. Ronaldo for A053320
%t A227346 Differences[Select[Prime[Range[200]], PrimeQ[# + 6] &]] (* _T. D. Noe_, Jul 09 2013 *)
%Y A227346 Cf. A023201 (n and n+6 are primes).
%Y A227346 Cf. A053320 (differences for Cousin primes).
%K A227346 nonn
%O A227346 1,1
%A A227346 _Luca Pezzullo_, Jul 08 2013