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-3 of 3 results.

A080268 Breadth-first-wise A014486-like encoding of the stunted binomial-mod-2 zigzag trees (A080263).

Original entry on oeis.org

2, 56, 968, 249728, 3996680, 1023152000, 261926931584, 17165643396644864, 274650294346579976, 70310475352724475776, 17999481690297465818240, 1179614032055334719872532480, 301981192206165688287372558464
Offset: 0

Views

Author

Antti Karttunen, Mar 02 2003

Keywords

Crossrefs

Same sequence in decimal: A080269.

Formula

a(n) = A014486(A080270(n))

A080264 A063171-encoding of the stunted binomial-mod-2 zigzag trees. See A080263.

Original entry on oeis.org

10, 110010, 1110001010, 111100100010110010, 1111100010001011001010, 111111001000100010110010110010, 11111110001010001000101100101110001010, 111111110010001011001000100010110010111100100010110010
Offset: 0

Views

Author

Antti Karttunen, Mar 02 2003

Keywords

Crossrefs

Breadth-first-wise encodings of the same trees: A080269.

Formula

a(n) = A007088(A080263(n)).

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)).
Showing 1-3 of 3 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.