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.

A284264 a(n) = A001222(A283983(n)).

Original entry on oeis.org

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

Views

Author

Antti Karttunen, Mar 25 2017

Keywords

Comments

a(n) = Sum_{c} floor(c/2), where c ranges over each coefficient of terms c * x^k in the Stern polynomial B(n,x), thus sum of the halved terms (for odd terms floored down) on row n of table A125184.

Crossrefs

Cf. A023758 (gives the positions of zeros).

Programs

Formula

a(n) = A001222(A283983(n)).
Other identities and observations. For all n >= 0:
a(2n) = a(n).
a(n) = (1/2) * (A002487(n) - A277700(n)).
2*a(n) <= A284272(n).