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.

A080319 Breadth-first-wise A063171-like-encoding of the branch-reduced binomial-mod-2 binary trees (A080294).

Original entry on oeis.org

10, 111000, 11111110000000, 1111111110000110000000, 11111111100001111111111000000000000000, 1111111110000111111111111000000000000110000000
Offset: 0

Views

Author

Antti Karttunen, Mar 02 2003

Keywords

Comments

These binary words converge to a certain infinite binary sequence: 1,1,1,1,1,1,1,1,1,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,0,0,0,... [To be computed.]

Crossrefs

Cf. A080269.

Formula

a(n) = A007088(A080318(n)).