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.

A070477 a(n) = n^3 mod 15.

Original entry on oeis.org

0, 1, 8, 12, 4, 5, 6, 13, 2, 9, 10, 11, 3, 7, 14, 0, 1, 8, 12, 4, 5, 6, 13, 2, 9, 10, 11, 3, 7, 14, 0, 1, 8, 12, 4, 5, 6, 13, 2, 9, 10, 11, 3, 7, 14, 0, 1, 8, 12, 4, 5, 6, 13, 2, 9, 10, 11, 3, 7, 14, 0, 1, 8, 12, 4, 5, 6, 13, 2, 9, 10, 11, 3, 7, 14, 0, 1, 8, 12, 4, 5, 6, 13, 2, 9, 10, 11, 3, 7, 14
Offset: 0

Views

Author

N. J. A. Sloane, May 12 2002

Keywords

Comments

It is also true that a(n) = n^(4k+3) mod 15 holds any k. - Gary Detlefs, Dec 15 2021

Programs

Formula

From G. C. Greubel, Mar 28 2016: (Start)
a(n) = a(n-15).
G.f.: (-x -8*x^2 -12*x^3 -4*x^4 -5*x^5 -6*x^6 -13*x^7 -2*x^8 -9*x^9 - 10*x^10 -11*x^11 -3*x^12 -7*x^13 -14*x^14)/(-1 + x^15). (End)