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.

A080787 a(1)=a(2)=1; a(n) = a(n-1) + last decimal digit of a(n-2).

Original entry on oeis.org

1, 1, 2, 3, 5, 8, 13, 21, 24, 25, 29, 34, 43, 47, 50, 57, 57, 64, 71, 75, 76, 81, 87, 88, 95, 103, 108, 111, 119, 120, 129, 129, 138, 147, 155, 162, 167, 169, 176, 185, 191, 196, 197, 203, 210, 213, 213, 216, 219, 225, 234, 239, 243, 252, 255, 257, 262, 269, 271
Offset: 1

Views

Author

Benoit Cloitre, Mar 12 2003

Keywords

Formula

a(n)=a(n-1)+a(n-2)(mod 10); for n>=3 a(n)-a(n-1)=A003893(n-2)=A000045(n-2)(mod 10)