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 A213904 #22 Jun 17 2013 15:20:13 %S A213904 1006301,0,11,1022381,0,3512051,1871,632081,0,1121831,15731,0,1481, %T A213904 1155611,1068251,0,18911,284741,0,12390011,191,821,0,3837131,875261,0, %U A213904 854921,10865291,18041,0,958541,680291,0,299471,1063961,663581,0,165701 %N A213904 a(n) is the initial member of the least pair of prime quadruples (of the form p, p+2, p+6, p+8) with a difference of 30*n, with no other prime quadruple between the pair. %C A213904 a(n) is 0 if no such pair of prime quadruples is conjectured to exist for the indicated difference. %C A213904 When n is congruent to 2 or 5 mod 7 (A047385) no solution exists because one of the terms is divisible by 7. [_Jud McCranie_, Jun 17 2013] %H A213904 Jud McCranie, <a href="/A213904/b213904.txt">Table of n, a(n) for n = 1..10000</a> %e A213904 For n=3, a(3)=11, since 11, 13, 17, 19 is a prime quadruple. The next prime quadruple is 101, 103, 107, 109. The difference 101-11=90, which is equal to 30*3. %Y A213904 Cf. A007530, A059925, A157967, A047385. %K A213904 nonn %O A213904 1,1 %A A213904 _Ray G. Opao_, Jun 24 2012