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.

A276952 Partial sums of A276950.

Original entry on oeis.org

0, 1, 1, 2, 3, 4, 4, 5, 5, 6, 7, 8, 8, 9, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 18, 19, 19, 20, 21, 22, 22, 23, 23, 24, 25, 26, 26, 27, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 36, 37, 37, 38, 39, 40, 40, 41, 41, 42, 43, 44, 44, 45, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 54, 55, 55, 56, 57, 58, 58, 59, 59, 60, 61
Offset: 0

Views

Author

Antti Karttunen, Sep 22 2016

Keywords

Comments

Each n occurs A276948(n) times.

Crossrefs

One more than A273663.
Cf. also A276948, A276951, A257682.

Programs

Formula

a(0) = 0; for n >= 1, a(n) = A276950(n) + a(n-1).
Other identities. For all n >= 1:
a(n) = 1 + A273663(n).