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.

A133890 Binomial(n+10,n) mod 10.

Original entry on oeis.org

1, 1, 6, 6, 1, 3, 8, 8, 8, 8, 6, 6, 6, 6, 6, 0, 5, 5, 0, 0, 5, 5, 0, 0, 0, 6, 6, 6, 6, 6, 8, 8, 3, 3, 8, 6, 1, 1, 6, 6, 0, 0, 0, 0, 0, 0, 0, 0, 5, 5, 6, 6, 1, 1, 6, 8, 8, 8, 8, 8, 6, 6, 6, 6, 1, 5, 0, 0, 5, 5, 0, 0, 0, 0, 0, 6, 6, 6, 6, 6, 3, 3, 8, 8, 3, 1, 6, 6, 6, 6, 0, 0, 0, 0, 0, 0, 5, 5, 0, 0, 1, 1, 6, 6, 6
Offset: 0

Views

Author

Hieronymus Fischer, Oct 10 2007

Keywords

Comments

Periodic with length A133900(10)=4*10^2=400.

Crossrefs

Programs

Formula

a(n) = binomial(n+10,10) mod 10.