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 A261470 #18 Aug 22 2015 10:07:27
%S A261470 1,2,0,0,0,0,4,-2,0,2,-4,0,4,2,-4,0,2,-4,2,2,0,4,-2,-6,0,0,0,12,0,-8,
%T A261470 -2,4,0,-4,4,-2,0,2,-4,4,0,-6,0,8,10,-8,-10,0,4,-2,4,4,-4,0,-4,0,2,-4,
%U A261470 6,12,-6,-12,0,12,2,-4,-4,-6,4,4,0,-2,-2,0,4,-2,0
%N A261470 a(n) = prime(n+3) - prime(n+2) - prime(n+1) + prime(n).
%H A261470 Reinhard Zumkeller, <a href="/A261470/b261470.txt">Table of n, a(n) for n = 1..10000</a>
%F A261470 a(n) = A001223(n+2) - A001223(n). - _Reinhard Zumkeller_, Aug 22 2015
%e A261470 a(5) = 19 - 17 - 13 + 11 = 0.
%t A261470 Table[Prime[i+3] - Prime[i+2] - Prime[i+1] + Prime[i], {i,100}] (* _G. C. Greubel_, Aug 20 2015 *)
%o A261470 (PARI) first(m)=vector(m,i,prime(i+3)+prime(i)-prime(i+1)-prime(i+2)) \\ _Anders Hellström_, Aug 20 2015
%o A261470 (Haskell)
%o A261470 a261470 n = a261470_list !! (n-1)
%o A261470 a261470_list = zipWith (-) (drop 2 a001223_list) a001223_list
%o A261470 -- _Reinhard Zumkeller_, Aug 22 2015
%Y A261470 Cf. A022884, A022885, A093667.
%Y A261470 Cf. A001223.
%K A261470 sign,easy
%O A261470 1,2
%A A261470 _Altug Alkan_, Aug 20 2015