A080264 -id:A080264 - cp's OEIS frontend

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

10, 111000, 1111001000, 111100111110000000, 1111001111110000001000, 111100111111000000111110000000, 11110011111100000011111100110010000000, 111100111111000000111111001100111111111000000000000000

Offset: 0

Antti Karttunen, Mar 02 2003

nonn

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.]

Cf. A080319.

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

A080263 A014486-encoding of the branch-reduced binomial-mod-2 binary trees.

Original entry on oeis.org

2, 50, 906, 247986, 4072138, 1059204274, 272900475786, 17953590946285746, 287705670922216138, 73724537815637830834, 18880972926031430339466, 1237678872789190922262530226, 316876593058175709191975346890

Offset: 0

Antti Karttunen, Mar 02 2003

nonn

These trees are obtained from the successive generations of Rule 90 cellular automaton (A070886) or Pascal's triangle computed modulo 2 (A047999), with alive cells of the automaton (respectively: the odd binomials) forming the vertices of the zigzag tree.

J. C. P. Miller, Periodic Forests of Stunted Trees, Phil. Tran. Roy. Soc. London A266 (1970) 63; A293 (1980) 48.

A. Karttunen, Initial terms illustrated

Same sequence in binary: A080264. Cf. A080265. Breadth-first-wise encodings of the same trees: A080268. Corresponding branch-reduced zigzag trees: A080293.

Number of edges in general trees/internal nodes in binary trees: A006046, number of zigzag-edges (those colored black in illustrations) is one less: A074330. Cf. A080978.

cp's OEIS Frontend

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

Views

Author

Keywords

Comments

Crossrefs

Formula