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.

A338550 Number of binary trees of height n such that the number of nodes at depth d equals d+1 for every d = 0..n.

Table of values

n a(n)
0 1
1 1
2 4
3 60
4 3360
5 705600
6 558835200
7 1678182105600
8 19198403288064000
9 840083731079104512000
10 141100463472046393835520000
11 91242050302344912388163665920000
12 227753296409896438988240405704212480000
13 2199573010737856838816729366169572868096000000
14 82356764599728553816070191604819734458909327360000000

List of values

[1, 1, 4, 60, 3360, 705600, 558835200, 1678182105600, 19198403288064000, 840083731079104512000, 141100463472046393835520000, 91242050302344912388163665920000, 227753296409896438988240405704212480000, 2199573010737856838816729366169572868096000000, 82356764599728553816070191604819734458909327360000000]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.