Alois P. Heinz, <a href="/A245091/b245091_1.txt">Table of n, a(n) for n = 0..300</a>
Alois P. Heinz, <a href="/A245091/b245091_1.txt">Table of n, a(n) for n = 0..300</a>
editing
approved
Alois P. Heinz, <a href="/A245091/b245091_1.txt">Table of n, a(n) for n = 0..125300</a>
approved
editing
editing
approved
a(n) ~ c * d^n / sqrt(n), where d = 4.9159375028212... (same as for A245090), c = 0.076188269997... . - Vaclav Kotesovec, Jul 12 2014
approved
editing
editing
approved
Alois P. Heinz, <a href="/A245091/b245091.txt">Table of n, a(n) for n = 0..125</a>
allocated for Alois P. Heinz
Number of (2n+1)-node rooted identity trees of height n.
1, 0, 0, 2, 12, 61, 301, 1460, 7019, 33628, 160934, 770109, 3686706, 17661288, 84675601, 406319271, 1951428049, 9380072046, 45124798445, 217252113080, 1046731684143, 5046754081095, 24348794377704, 117547968556766, 567818803946292, 2744396907325759
0,4
a(n) = A227819(2n+1,n).
Cf. A227819.
allocated
nonn
Alois P. Heinz, Jul 11 2014
approved
editing
allocated for Alois P. Heinz
allocated
approved