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.

Showing 1-1 of 1 results.

A131091 Partial sums of A131707.

Original entry on oeis.org

1, 2, 5, 12, 19, 20, 29, 38, 45, 48, 51, 60, 61, 62, 65, 72, 79, 80, 89, 98, 105, 108, 111, 120, 121, 122, 125, 132, 139, 140, 149, 158, 165, 168, 171, 180, 181, 182, 185, 192, 199, 200, 209, 218, 225, 228, 231, 240, 241, 242, 245, 252, 259, 260, 269, 278, 285
Offset: 0

Views

Author

Paul Curtz, Sep 24 2007

Keywords

Crossrefs

Programs

  • Mathematica
    Accumulate[PadRight[{},60,{1,1,3,7,7,1,9,9,7,3,3,9}]] (* Harvey P. Dale, Jul 30 2025 *)

Formula

a(n) = Sum_{i=0..n} A131707(i), where A131707(n) = A001333(n) mod 10.
O.g.f.: (9x^6-6x^5+4x^3+2x^2+1)/((x-1)^2*(x^2+1)*(x^4-x^2+1)). - R. J. Mathar, Jul 16 2008
a(n) = 2*a(n-1) - a(n-2) - a(n-6) + 2*a(n-7) - a(n-8) for n > 7. - Chai Wah Wu, Jan 09 2021

Extensions

Edited by R. J. Mathar, Jul 16 2008
Showing 1-1 of 1 results.