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 A290162 #19 Jun 07 2024 10:49:51
%S A290162 5647457,18117977,21705503,32465063,37091597,57269633,90217163,
%T A290162 109933673,111053573,124123133,145594583,146742863,163123997,
%U A290162 200416343,239659907,245333267,272213813,335971367,350795033,470838833,701465327,749927357,888801707,1060690667
%N A290162 Initial primes of 8 consecutive primes with 7 consecutive gaps 14, 12, 10, 8, 6, 4, 2.
%C A290162 All terms = {17,23} mod 30.
%C A290162 For initial primes of 8 consecutive primes with consecutive gaps 2, 4, 6, 8, 10, 12, 14 see A190838.
%H A290162 Chai Wah Wu, <a href="/A290162/b290162.txt">Table of n, a(n) for n = 1..200</a>
%e A290162 Prime(390215..390222) = {5647457, 5647471, 5647483, 5647493, 5647501, 5647507, 5647511, 5647513} and 5647457 + 14 = 5647471, 5647471 + 12 = 5647483, 5647483 + 10 = 5647493, 5647493 + 8 = 5647501, 5647501 + 6 = 5647507, 5647507 + 4 = 5647511, 5647511 + 2 = 5647513.
%o A290162 (GAP)
%o A290162 P:=Filtered([1..100000000],IsPrime);; I:=Reversed([2,4,6,8,10,12,14]);;
%o A290162 P1:=List([1..Length(P)-1],i->P[i+1]-P[i]);; Collected(last);;
%o A290162 P2:=List([1..Length(P)-Length(I)],i->[P1[i],P1[i+1],P1[i+2],P1[i+3],P1[i+4],P1[i+5],P1[i+6]]);;
%o A290162 P3:=List(Positions(P2,I),i->P[i]); Length(P3);
%Y A290162 Cf. A078847, A190814, A190817, A190819, A190838, A286891, A290161.
%K A290162 nonn
%O A290162 1,1
%A A290162 _Muniru A Asiru_, Jul 22 2017
%E A290162 a(8)-a(24) from _Giovanni Resta_, Jul 25 2017