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.

A070697 Duplicate of A070477.

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 13 2002

Keywords

Comments

a(n)=A070477(n). [Proof: (n^7-n^3) == 0 (mod 15) is shown for n=0 to 14 explicitly. Then binomial expansion of (n+15)^7 and (n+15)^3 extend this by induction n->n+15 to all other indices.] - R. J. Mathar, Oct 30 2009

Crossrefs

Cf. A008960.

Programs