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.

Showing 1-2 of 2 results.

A080269 Breadth-first-wise A063171-like-encoding of the stunted binomial-mod-2 zigzag trees (A080264).

Original entry on oeis.org

10, 111000, 1111001000, 111100111110000000, 1111001111110000001000, 111100111111000000111110000000, 11110011111100000011111100110010000000, 111100111111000000111111001100111111111000000000000000
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,0,0,1,1,1,1,1,1,0,0,0,... [To be computed.]

Crossrefs

Cf. A080319.

Formula

a(n) = A007088(A080268(n)).

A080294 A063171-encoding of the branch-reduced binomial-mod-2 binary trees.

Original entry on oeis.org

10, 110010, 11100100110010, 1111001001001100110010, 11111001001100100100110011100100110010, 1111110010010011001001001100111001001100110010
Offset: 0

Views

Author

Antti Karttunen, Mar 02 2003

Keywords

Crossrefs

Same sequence in decimal: A080293. Breadth-first-wise encoding: A080319.

Formula

a(n) = A007088(A080293(n)).
Showing 1-2 of 2 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.