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.

A053794 a(n) = (n^2 + n) modulo 8.

Original entry on oeis.org

0, 2, 6, 4, 4, 6, 2, 0, 0, 2, 6, 4, 4, 6, 2, 0, 0, 2, 6, 4, 4, 6, 2, 0, 0, 2, 6, 4, 4, 6, 2, 0, 0, 2, 6, 4, 4, 6, 2, 0, 0, 2, 6, 4, 4, 6, 2, 0, 0, 2, 6, 4, 4, 6, 2, 0, 0, 2, 6, 4, 4, 6, 2, 0, 0, 2, 6, 4, 4, 6, 2, 0, 0, 2, 6, 4, 4, 6, 2, 0, 0, 2, 6, 4, 4, 6, 2, 0, 0, 2, 6, 4, 4, 6, 2, 0, 0, 2, 6, 4, 4, 6, 2, 0
Offset: 0

Views

Author

Stuart M. Ellerstein (ellerstein(AT)aol.com), Mar 27 2000

Keywords

Comments

Periodic with period 8.

Crossrefs

Programs

Formula

From Wesley Ivan Hurt, Jun 22 2022: (Start)
a(n) = 2*A105198(n).
a(n) = a(n-1)-a(n-2)+a(n-3)-a(n-4)+a(n-5)-a(n-6)+a(n-7). (End)

Extensions

More terms from James Sellers, Apr 08 2000
Extended to n=103 by Antti Karttunen, Aug 10 2017