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 A346675 #36 Jul 29 2021 11:49:28 %S A346675 4,6,6,14,10,20,12,28,6,36,8,34,6,14,22,18,26,16,24,36,78,8,28,74,36, %T A346675 30,24,16,26,148,6,12,24,24,144,8,22,8,28,66,74,46,14,10,20,106,26,28, %U A346675 6,120,14,66,16,24,68,76,12,60,24,30,36,48,12,30,8,16,90,30 %N A346675 First differences of A088176. %C A346675 Conjecture: each term > 4 appears at least twice. %C A346675 Every term of the sequence is even, because every term is a difference of two odd primes. %F A346675 a(n) = A088176(n+2) - A088176(n+1). %e A346675 a(7) = A088176(9) - A088176(8) = 107 - 79 = 28. %e A346675 p = 14855077 and q = 14856077 are prime numbers such that the respective preceding prime number is the greater of twin primes. No other prime number between p and q has this property. Thus 1000 is a term of the sequence. %t A346675 Differences[NextPrime/@Select[Prime@Range[500],NextPrime[#,-1]==#-2&]] (* _Giorgos Kalogeropoulos_, Jul 28 2021 *) %Y A346675 Cf. A088176. %K A346675 nonn,easy %O A346675 1,1 %A A346675 _Luca Santarsiero_, Jul 28 2021