|
|
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.
|
|
4
|
|
|
1, 2, 3, 6, 10, 12, 17, 26, 34, 50, 56, 68, 82, 94, 113
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
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=Catalan(5).
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|