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.

A061353 First column of array shown in A061352.

Original entry on oeis.org

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

Views

Author

Amarnath Murthy, Apr 28 2001

Keywords

Comments

Least significant digit of the n-th triangular number if n is even.

Formula

a(1)=1; if n even, a(n+1)=(a(n)+1) mod 10; if n odd, a(n+1)=(a(n)+2n) mod 10.
a(2n-1) = n*(2n-1)- 10*Floor[n*(2n-1)/10] +1, a(2n) = n(2n+1)- 10*Floor[n*(2n+1)/10].

Extensions

More terms and formula from Larry Reeves (larryr(AT)acm.org), May 15 2001