cp's OEIS Frontend

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.

A261470 a(n) = prime(n+3) - prime(n+2) - prime(n+1) + prime(n).

Original entry on oeis.org

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, -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, 6, 12, -6, -12, 0, 12, 2, -4, -4, -6, 4, 4, 0, -2, -2, 0, 4, -2, 0
Offset: 1

Views

Author

Altug Alkan, Aug 20 2015

Keywords

Examples

			a(5) = 19 - 17 - 13 + 11 = 0.
		

Crossrefs

Programs

  • Haskell
    a261470 n = a261470_list !! (n-1)
    a261470_list = zipWith (-) (drop 2 a001223_list) a001223_list
    -- Reinhard Zumkeller, Aug 22 2015
  • Mathematica
    Table[Prime[i+3] - Prime[i+2] - Prime[i+1] + Prime[i], {i,100}] (* G. C. Greubel, Aug 20 2015 *)
  • PARI
    first(m)=vector(m,i,prime(i+3)+prime(i)-prime(i+1)-prime(i+2)) \\ Anders Hellström, Aug 20 2015
    

Formula

a(n) = A001223(n+2) - A001223(n). - Reinhard Zumkeller, Aug 22 2015