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.

A152303 a(n) = b(n) mod 10, where b(n) = b(n-1) + b(n-2) + floor(b(n-2)/10), b(0) = b(1) = 1.

Original entry on oeis.org

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

Views

Author

Roger L. Bagula, Dec 02 2008

Keywords

Crossrefs

Programs

  • Mathematica
    M = {{0, 1}, {1, 1}}; M1 = {{0, 0}, {1/10, 0}};
    v[0] = {1, 1};
    v[n_] := v[n] = M.v[n - 1] + Floor[M1.v[n - 1]];
    Table[Mod[v[n][[1]], 10], {n, 0, 100}]

Extensions

Meaningful name from Dominic McCarty, Jul 01 2025