|
|
|
|
| A248099
|
|
Number of ordered trees with root degree n and having strictly thinning limbs. An ordered tree with strictly thinning limbs is such that if a node has k children, each of its children has less than k children.
(history;
published version)
|
|
|
|
|
#15 by Bruno Berselli at Sat Jan 10 13:27:33 EST 2015
|
|
|
|
|
|
|
|
#14 by Joerg Arndt at Sat Jan 10 10:46:43 EST 2015
|
|
|
|
|
|
Discussion
|
| Sat Jan 10
| 10:50
| Emeric Deutsch: Thanks.
|
|
|
|
|
|
|
#13 by Emeric Deutsch at Sat Jan 10 10:42:23 EST 2015
|
|
|
|
|
|
|
|
#12 by Emeric Deutsch at Sat Jan 10 10:42:03 EST 2015
|
|
| FORMULA
|
a(1)=1; a(n) = (1 + a(1) + ... + a(n-1))^n for n>=2.
|
|
|
|
|
|
|
#11 by Emeric Deutsch at Fri Jan 09 14:41:29 EST 2015
|
|
|
|
|
|
|
|
#10 by Jon E. Schoenfield at Fri Jan 09 14:39:59 EST 2015
|
|
|
|
|
|
Discussion
|
| Fri Jan 09
| 14:41
| Emeric Deutsch: Thanks
|
|
|
|
|
|
|
#9 by Jon E. Schoenfield at Fri Jan 09 14:39:57 EST 2015
|
|
| CROSSREFS
|
Cf. A110387.
|
|
| STATUS
|
proposed
editing
|
|
|
|
|
|
|
#8 by Jon E. Schoenfield at Fri Jan 09 14:39:34 EST 2015
|
|
|
|
|
|
|
|
#7 by Jon E. Schoenfield at Fri Jan 09 14:39:32 EST 2015
|
|
| EXAMPLE
|
a(2)=4; indeed, we have /\ /\ and the 3 trees obtained by hanging | to either of the leaves of /\ or to both of them.
|
|
| STATUS
|
reviewed
editing
|
|
|
|
|
|
|
#6 by Emeric Deutsch at Fri Jan 09 12:33:45 EST 2015
|
|
|
|
|
|
|
