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.

A096320 a(n) = (n^2+n+4)/2, modulo 10.

Original entry on oeis.org

2, 3, 5, 8, 2, 7, 3, 0, 8, 7, 7, 8, 0, 3, 7, 2, 8, 5, 3, 2, 2, 3, 5, 8, 2, 7, 3, 0, 8, 7, 7, 8, 0, 3, 7, 2, 8, 5, 3, 2, 2, 3, 5, 8, 2, 7, 3, 0, 8, 7, 7, 8, 0, 3, 7, 2, 8, 5, 3, 2, 2, 3, 5, 8, 2, 7, 3, 0, 8, 7, 7, 8, 0, 3, 7, 2, 8, 5, 3, 2, 2, 3, 5, 8, 2, 7, 3, 0, 8, 7, 7, 8, 0, 3, 7, 2, 8, 5, 3, 2, 2, 3, 5, 8, 2
Offset: 0

Views

Author

Cino Hilliard, Aug 02 2004

Keywords

Comments

This periodic sequence equals A008954(n)+2 modulo 10 and also A061501(n+1)+1 modulo 10.

Crossrefs

Programs

  • Mathematica
    Table[Mod[(n^2+n+4)/2,10],{n,0,110}] (* or *) LinearRecurrence[ {0,0,0,0,1,0,0,0,0,-1,0,0,0,0,1},{2,3,5,8,2,7,3,0,8,7,7,8,0,3,7},110] (* Harvey P. Dale, Nov 16 2012 *)

Formula

a(0)=2, a(1)=3, a(2)=5, a(3)=8, a(4)=2, a(5)=7, a(6)=3, a(7)=0, a(8)=8, a(9)=7, a(10)=7, a(11)=8, a(12)=0, a(13)=3, a(14)=7, a(n)=a(n-5)-a(n-10)+ a(n-15). - Harvey P. Dale, Nov 16 2012

Extensions

Edited by Don Reble, Apr 16 2007