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.

A140684 A037481 mod 10.

Original entry on oeis.org

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

Views

Author

Paul Curtz, Jul 11 2008

Keywords

Comments

The sequence is periodic with length 10 and contains all 10 digits.
The first differences 1, 5, -1, -3, 7, -1, -5, 1, 3, -7 are also periodic with period length 10.

Formula

a(n) = A037481(n) mod 10. a(n)= a(n-10).
a(n)+a(n+5)= A010734(n).
O.g.f.: (7x^4-3x^3-x^2+5x+1)x/((1-x)(1+x)(x^4-x^3+x^2-x+1)). - R. J. Mathar, Jul 14 2008

Extensions

Edited by R. J. Mathar, Jul 14 2008