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 A174839 #8 Dec 13 2024 13:06:14
%S A174839 3,5,7,11,5,7,11,13,11,13,17,19,101,103,107,109,191,193,197,199,821,
%T A174839 823,827,829,1481,1483,1487,1489,1871,1873,1877,1879,2081,2083,2087,
%U A174839 2089,3251,3253,3257,3259
%N A174839 Lists of 4 adjacent primes such that the difference between the highest minus the lowest = 8.
%H A174839 Harvey P. Dale, <a href="/A174839/b174839.txt">Table of n, a(n) for n = 1..1000</a>
%F A174839 a(n) >> n log^4 n. - _Charles R Greathouse IV_, Dec 13 2024
%t A174839 Flatten[Select[Partition[Prime[Range[500]],4,1],Last[#]-First[#]==8&]] (* _Harvey P. Dale_, Oct 01 2013 *)
%o A174839 (C) if (primes[i+3] - primes[i] == 8) { printf("%u, %u, %u, %u, \n", primes[i] , primes[i+1], primes[i+2] , primes[i+3]); }
%K A174839 nonn,tabf
%O A174839 1,1
%A A174839 _Robert Hutchins_, Mar 30 2010