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.

Previous Showing 11-18 of 18 results.

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

A036423 Number of ternary rooted trees with n nodes and height exactly 8.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 1, 7, 34, 129, 432, 1320, 3807, 10505, 28094, 73290, 187579, 472612, 1175580, 2892389, 7050272, 17045235, 40913418, 97571239, 231337744, 545590039, 1280487083, 2991833084, 6961385026, 16135193088, 37263361364
Offset: 0

Views

Author

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

Keywords

Links

Crossrefs

Cf. A036370, A036437.

Formula

a(n) = A036376(n) - A036375(n). - Sean A. Irvine, Oct 31 2020

A036424 Number of ternary rooted trees with n nodes and height exactly 9.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 8, 43, 180, 657, 2175, 6746, 19923, 56766, 157273, 426372, 1135812, 2983032, 7742322, 19896231, 50695676, 128224079, 322221166, 805088502, 2001225122, 4951394924, 12198848726, 29938095480, 73210846964
Offset: 0

Views

Author

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

Keywords

Links

Crossrefs

Cf. A036370, A036437.

A036419 Number of ternary rooted trees with n nodes and height exactly 4.

Original entry on oeis.org

0, 0, 0, 0, 1, 3, 8, 15, 27, 43, 67, 97, 136, 183, 239, 300, 369, 432, 498, 551, 594, 614, 624, 601, 570, 514, 453, 378, 312, 238, 181, 128, 89, 56, 37, 20, 12, 6, 3, 1, 1
Offset: 0

Views

Author

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

Keywords

Links

Crossrefs

Cf. A036370, A036437.

A036425 Number of ternary rooted trees with n nodes and height exactly 10.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 9, 53, 242, 954, 3391, 11220, 35180, 105948, 309175, 880175, 2456272, 6744581, 18273594, 48960386, 129945805, 342114018, 894423399, 2324138696, 6006737947, 15450039511, 39568319805, 100941888863, 256597420700
Offset: 0

Views

Author

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

Keywords

Links

Crossrefs

Cf. A036370, A036437.

A036426 Number of ternary rooted trees with n nodes and height exactly 11.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 10, 64, 316, 1336, 5065, 17774, 58840, 186322, 569740, 1694449, 4927345, 14067397, 39554994, 109815312, 301618216, 820875862, 2216564889, 5944589510, 15848003806, 42028780558, 110941624229, 291629971309
Offset: 0

Views

Author

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

Keywords

Links

Crossrefs

Cf. A036370, A036437.

A036427 Number of ternary rooted trees with n nodes and height exactly 12.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 11, 76, 403, 1817, 7309, 27079, 94252, 312620, 998058, 3090168, 9331500, 27604348, 80270182, 230077622, 651469482, 1825536305, 5069886635, 13971416287, 38242837777, 104061066617, 281680779030, 758947045088
Offset: 0

Views

Author

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

Keywords

Links

Crossrefs

Cf. A036370, A036437.

A036443 Number of ternary rooted trees with n nodes and height exactly 3.

Original entry on oeis.org

0, 0, 0, 1, 2, 4, 4, 5, 4, 4, 3, 2, 1, 1
Offset: 0

Views

Author

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

Keywords

Links

Crossrefs

Cf. A036370, A036437.
Previous Showing 11-18 of 18 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.