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.

A004155 Sum of digits of n-th odd number.

Original entry on oeis.org

1, 3, 5, 7, 9, 2, 4, 6, 8, 10, 3, 5, 7, 9, 11, 4, 6, 8, 10, 12, 5, 7, 9, 11, 13, 6, 8, 10, 12, 14, 7, 9, 11, 13, 15, 8, 10, 12, 14, 16, 9, 11, 13, 15, 17, 10, 12, 14, 16, 18, 2, 4, 6, 8, 10, 3, 5, 7, 9, 11, 4, 6, 8, 10, 12, 5
Offset: 0

Views

Author

Keywords

Crossrefs

Programs

Formula

a(n) = 2n - 1 - 9*Sum_{k=1..1+floor(log_10(2n-1))} floor( (n-1)/(5*10^(k-1)) ). - Anthony Browne, Jun 18 2016
a(n) = A004092(n+5). - G. C. Greubel, Jun 19 2016