The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A002449

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A002449

Number of different types of binary trees of height n.
(history; published version)

#67 by Michael De Vlieger at Sun Dec 12 09:28:35 EST 2021

STATUS

reviewed

approved

#66 by Joerg Arndt at Sun Dec 12 02:18:00 EST 2021

STATUS

proposed

reviewed

#65 by Michel Marcus at Sun Dec 12 02:15:38 EST 2021

STATUS

editing

proposed

#64 by Michel Marcus at Sun Dec 12 02:15:28 EST 2021

LINKS

M. Cook and M. Kleber, <a href="httphttps://www.combinatoricsdoi.org/10.37236/1522">Tournament sequences and Meeussen sequences</a>, Electronic J. Comb. 7 (2000), #R44.

STATUS

approved

editing

#63 by Alois P. Heinz at Sun May 02 14:13:41 EDT 2021

STATUS

editing

approved

#62 by Alois P. Heinz at Sun May 02 14:12:44 EDT 2021

MAPLE

d := proc(n) option remember; if n=0 <1 then 1 else sum(d(n-1), k=1..2*k) fi end; A002449 := n -> eval(d(n-1), k=1); # Michael Kleber, Dec 05 2000

STATUS

approved

editing

Discussion

Sun May 02

14:13

Alois P. Heinz: so it gives correct answer for n=0 also ...

#61 by Alois P. Heinz at Wed Feb 13 21:31:47 EST 2019

STATUS

editing

approved

#60 by Alois P. Heinz at Wed Feb 13 21:11:25 EST 2019

DATA

1, 1, 2, 6, 26, 166, 1626, 25510, 664666, 29559718, 2290267226, 314039061414, 77160820913242, 34317392762489766, 27859502236825957466, 41575811106337540656038, 114746581654195790543205466, 588765612737696531880325270438, 5642056933026209681424588087899226

STATUS

approved

editing

#59 by Joerg Arndt at Thu Jan 31 01:56:23 EST 2019

STATUS

reviewed

approved

#58 by Michael B. Porter at Thu Jan 31 01:53:13 EST 2019

STATUS

proposed

reviewed