|
Search: id:A038775
|
|
|
| A038775 |
|
a[n] is the number of cycles of the permutation that converts forest[n] of depth-first planar planted binary trees into breadth-first representation. |
|
+0
4
|
|
| 1, 2, 3, 6, 10, 12, 17, 26, 34, 50, 56, 68
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
EXAMPLE
|
a[5]=10 since there are 10 cycles in this permutation of forest[5], with lengths 1, 1, 3, 4, 3, 2, 16, 8, 2, 2 summing up to 42=cat[5].
|
|
CROSSREFS
|
The first a[n] terms of A038774 add up to cat[n].
Similarly generated sequences: A001683, A002995, A003239, A057507, A057513.
Sequence in context: A090695 A104074 A140785 this_sequence A065029 A120754 A023547
Adjacent sequences: A038772 A038773 A038774 this_sequence A038776 A038777 A038778
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Wouter Meeussen (wouter.meeussen(AT)pandora.be), May 04 2000
|
|
|
Search completed in 0.002 seconds
|
