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.

A273662 Least monotonic left inverse for A256450: a(1) = 0; for n > 1, a(n) = A257680(n) + a(n-1).

Original entry on oeis.org

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

Views

Author

Antti Karttunen, May 29 2016

Keywords

Comments

Partial sums of A257680 from term A257680(2) onward.

Crossrefs

One less than A257682.
Cf. also A273663.

Programs

  • Python
    def a007623(n, p=2): return n if n

Formula

a(1) = 0; for n > 1, a(n) = A257680(n) + a(n-1).
Other identities.
For all n >= 1, a(n) = A257682(n)-1.
For all n >= 0, a(A256450(n)) = n. [This sequence works as a left inverse of A256450.]