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.

A236833 a(n) = number of times n occurs in A234741.

Original entry on oeis.org

1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 4, 1, 1, 2, 1, 1, 2, 1, 0, 1, 2, 1, 2, 2, 1, 1, 1, 4, 1, 1, 1, 1, 3, 2, 1, 1, 1, 1, 2, 2, 1, 1, 1, 0, 4, 1, 2, 2, 0, 1, 3, 2, 1, 2, 1, 1, 1, 1, 2, 1, 1, 4, 1, 1, 2, 1, 1, 1, 4, 1, 1, 3, 1, 2, 1, 1, 3, 1, 6, 1, 0
Offset: 0

Views

Author

Antti Karttunen, Jan 31 2014

Keywords

Comments

Number of distinct values k such that A234741(k) = n.

Crossrefs

A236834 gives the positions of zeros, A236835 the positions of terms larger than one, A236841 the positions of terms other than zero.

Formula

a(2n) = a(n).
This should also have a direct formula, mirroring the formula for A236853. Cf. also A236861.