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.

A070379 a(n) = 5^n mod 29.

Original entry on oeis.org

1, 5, 25, 9, 16, 22, 23, 28, 24, 4, 20, 13, 7, 6, 1, 5, 25, 9, 16, 22, 23, 28, 24, 4, 20, 13, 7, 6, 1, 5, 25, 9, 16, 22, 23, 28, 24, 4, 20, 13, 7, 6, 1, 5, 25, 9, 16, 22, 23, 28, 24, 4, 20, 13, 7, 6, 1, 5, 25, 9, 16, 22, 23, 28, 24, 4, 20, 13, 7, 6, 1, 5, 25, 9, 16, 22, 23, 28, 24, 4, 20
Offset: 0

Views

Author

N. J. A. Sloane, May 12 2002

Keywords

Programs

Formula

From R. J. Mathar, Apr 20 2010: (Start)
a(n) = a(n-1) - a(n-7) + a(n-8).
G.f.: ( -1-4*x-20*x^2+16*x^3-7*x^4-6*x^5-x^6-6*x^7 ) / ( (x-1)*(1+x)*(x^6-x^5+x^4-x^3+x^2-x+1) ). (End)
a(n) = a(n-14). - G. C. Greubel, Mar 16 2016