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.

A036421 Number of ternary rooted trees with n nodes and height exactly 6.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 1, 5, 19, 56, 151, 374, 889, 2032, 4529, 9858, 21075, 44320, 91928, 188288, 381392, 764683, 1519026, 2991601, 5844950, 11334761, 21827329, 41755112, 79376196, 149991258, 281805933, 526546799, 978614867, 1809450608
Offset: 0

Views

Author

N. J. A. Sloane, Eric Rains (rains(AT)caltech.edu)

Keywords

Links

Crossrefs

Cf. A036370, A036437.

Formula

a(n) = A036374(n) - A036373(n). - Sean A. Irvine, Oct 31 2020

A036422 Number of ternary rooted trees with n nodes and height exactly 7.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 1, 6, 26, 88, 267, 743, 1968, 5006, 12394, 29984, 71289, 166927, 386042, 882887, 1999964, 4491226, 10008151, 22144282, 48681992, 106384313, 231200051, 499868227, 1075542674, 2303703530, 4913213715, 10436198873
Offset: 0

Views

Author

N. J. A. Sloane, Eric Rains (rains(AT)caltech.edu)

Keywords

Links

Crossrefs

Cf. A036370, A036437.

Formula

a(n) = A036375(n) - A036374(n). - Sean A. Irvine, Oct 31 2020
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.