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 A219244 #10 Jun 26 2022 05:10:03 %S A219244 1,1,1,1,1,2,2,1,1,1,1,1,3,1,1,1,1,2,2,1,1,1,1,2,1,1,3,1,1,2,1,2,1,1, %T A219244 3,1,2,2,1,1,1,4,1,1,1,3,1,2,1,1,1,1,3,4,1,1,1,1,1,1,3,1,1,1,1,1,1,2, %U A219244 1,2,2,1,2,1,1,1,2,2,1,1,2,1,1,1,1,1 %N A219244 Differences of two consecutive primes which both equal 1 modulo 3, divided by 6. %C A219244 a(n) = (A217659(n) - A185934(n)) / 6. %H A219244 Reinhard Zumkeller, <a href="/A219244/b219244.txt">Table of n, a(n) for n = 1..1000</a> %t A219244 (Last[#]-First[#])/6&/@Select[Partition[Prime[Range[800]],2,1], Mod[First[#],3] == Mod[Last[#],3]==1&] (* _Harvey P. Dale_, Feb 26 2013 *) %o A219244 (Haskell) %o A219244 a219244 n = a219244_list !! (n-1) %o A219244 a219244_list = map (`div` 6) $ zipWith (-) a217659_list a185934_list %Y A219244 Cf. A185934, A217659. %K A219244 nonn %O A219244 1,6 %A A219244 _Reinhard Zumkeller_, Nov 16 2012