A038774 Cycle lengths of the permutation that converts the forest of depth-first planar planted binary trees into breadth-first representation.

1, 1, 3, 4, 3, 2, 16, 8, 2, 2, 87, 3, 202, 25, 5, 4, 61, 607, 63, 165, 127, 12, 8, 10, 4, 5, 927, 1441, 283, 625, 91, 52, 8, 5, 4708, 592, 1890, 86, 3505, 482, 471, 34, 84, 17, 22, 25, 5, 9, 3, 1

Offset

1,3

Links

Table of n, a(n) for n=1..50.

Example

The first 6 terms add up to 14=cat[4], so the cycle lengths of the permutation for forest[4] are {1, 1, 3, 4, 3, 2}. The sequence as given (50 terms) was generated on forest[10].

Crossrefs

Cf. A038775, A038776. Max cycle lengths: A057542.

Sequence in context: A199286 A188722 A257526 * A092910 A356334 A322347

Adjacent sequences: A038771 A038772 A038773 * A038775 A038776 A038777

Keyword

nonn

Author

Wouter Meeussen, May 04 2000

Status

approved