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.

A070437 a(n) = n^2 mod 14.

Original entry on oeis.org

0, 1, 4, 9, 2, 11, 8, 7, 8, 11, 2, 9, 4, 1, 0, 1, 4, 9, 2, 11, 8, 7, 8, 11, 2, 9, 4, 1, 0, 1, 4, 9, 2, 11, 8, 7, 8, 11, 2, 9, 4, 1, 0, 1, 4, 9, 2, 11, 8, 7, 8, 11, 2, 9, 4, 1, 0, 1, 4, 9, 2, 11, 8, 7, 8, 11, 2, 9, 4, 1, 0, 1, 4, 9, 2, 11, 8, 7, 8, 11, 2, 9, 4, 1, 0, 1, 4, 9, 2, 11, 8, 7, 8, 11, 2, 9, 4
Offset: 0

Views

Author

N. J. A. Sloane, May 12 2002

Keywords

Crossrefs

Programs

Formula

G.f.: -x*(1 +4*x +9*x^2 +2*x^3 +11*x^4 +8*x^5 +7*x^6 +8*x^7 +11*x^8 +2*x^9 +9*x^10 +4*x^11 +x^12) / ((x-1)*(1+x^6+x^5+x^4+x^3+x^2+x)*(1+x)*(1-x+x^2-x^3+x^4-x^5+x^6)). - R. J. Mathar, Jul 27 2015
a(n) = a(n-14). - G. C. Greubel, Mar 24 2016