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.
%I A022005 #70 Jun 08 2025 22:51:43
%S A022005 7,13,37,67,97,103,193,223,277,307,457,613,823,853,877,1087,1297,1423,
%T A022005 1447,1483,1663,1693,1783,1867,1873,1993,2083,2137,2377,2683,2707,
%U A022005 2797,3163,3253,3457,3463,3847,4153,4513,4783,5227,5413,5437,5647,5653,5737,6547
%N A022005 Initial members of prime triples (p, p+4, p+6).
%C A022005 Subsequence of A029710. - _R. J. Mathar_, May 06 2017
%C A022005 All terms are congruent to 1 (modulo 6). - _Matt C. Anderson_, May 22 2015
%H A022005 Matt C. Anderson, <a href="/A022005/b022005.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..1000 from T. D. Noe).
%H A022005 Tony Forbes and Norman Luhn, <a href="http://www.pzktupel.de/ktuplets">Prime k-tuplets</a>.
%H A022005 Maxie D. Schmidt, <a href="https://arxiv.org/abs/1701.04741">New Congruences and Finite Difference Equations for Generalized Factorial Functions</a>, arXiv:1701.04741 [math.CO], 2017.
%H A022005 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/PrimeTriplet.html">Prime Triplet</a>.
%t A022005 Select[Table[Prime[n], {n, 2000}], PrimeQ[# + 4] && PrimeQ[# + 6] &] (* _Vladimir Joseph Stephan Orlovsky_, Jun 19 2011 *)
%o A022005 (Magma) [p: p in PrimesUpTo(10000) | IsPrime(p+4) and IsPrime(p+6)]; // _Vincenzo Librandi_, Aug 23 2015
%o A022005 (PARI) select(p->isprime(p+4) && isprime(p+6), primes(1000)) \\ _Charles R Greathouse IV_, Mar 17 2023
%Y A022005 Subsequence of A029710 and of A002476.
%Y A022005 Subsequence of A007529.
%Y A022005 Cf. A001359, A073649, A098413.
%K A022005 nonn,easy
%O A022005 1,1
%A A022005 _Warut Roonguthai_