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.

A070392 a(n) = 6^n mod 11.

Original entry on oeis.org

1, 6, 3, 7, 9, 10, 5, 8, 4, 2, 1, 6, 3, 7, 9, 10, 5, 8, 4, 2, 1, 6, 3, 7, 9, 10, 5, 8, 4, 2, 1, 6, 3, 7, 9, 10, 5, 8, 4, 2, 1, 6, 3, 7, 9, 10, 5, 8, 4, 2, 1, 6, 3, 7, 9, 10, 5, 8, 4, 2, 1, 6, 3, 7, 9, 10, 5, 8, 4, 2, 1, 6, 3, 7, 9, 10, 5, 8, 4, 2, 1, 6, 3, 7
Offset: 0

Views

Author

N. J. A. Sloane, May 12 2002

Keywords

Comments

Period 10 (Repeat): [1, 6, 3, 7, 9, 10, 5, 8, 4, 2, ...]. The sequence contains every number from 1 to 10 and only those numbers. - Wesley Ivan Hurt, May 19 2014

Programs

Formula

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