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.

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

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

Original entry on oeis.org

2, 50, 14642, 3969842, 267572689202, 69427226972978, 4581045692538239282, 301220569271221714981682, 1295918094920364850246919050705202, 332029112115571675270693117549056818
Offset: 0

Views

Author

Antti Karttunen, Mar 02 2003

Keywords

Comments

These are obtained from the stunted binomial-mod-2 zigzag trees (A080263) either by extending each leaf to a branch of two leaves, or by branch-reducing every other such tree.

Crossrefs

a(n) = A014486(A080295(n)). Same sequence in binary: A080294. Breadth-first-wise encoding: A080318. "Moose-trees" obtained from these: A080973. Cf. A080292, A080297.

Formula

a(n) = A080310(A080263(n)) = A014486(A080298(A080265(n))) = A014486(A080979(A080265(2*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.