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.

A364260 a(n) = A331410(A332214(n)).

Original entry on oeis.org

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

Views

Author

Antti Karttunen, Jul 16 2023

Keywords

Crossrefs

Cf. A131577 (positions of 0's), A335431 (of 1's).
Differs from related A334204 for the first time at n=31, where a(31) = 1, while A334204(31) = 2.

Formula

a(n) = A364259(A163511(n)).
For all n >= 0, a(2^n) = 0, a(2^n + 1) = n.