This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A038774 #5 Mar 30 2012 18:37:41
%S A038774 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,
%T A038774 927,1441,283,625,91,52,8,5,4708,592,1890,86,3505,482,471,34,84,17,22,
%U A038774 25,5,9,3,1
%N A038774 Cycle lengths of the permutation that converts the forest of depth-first planar planted binary trees into breadth-first representation.
%e A038774 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].
%Y A038774 Cf. A038775, A038776. Max cycle lengths: A057542.
%K A038774 nonn
%O A038774 1,3
%A A038774 _Wouter Meeussen_, May 04 2000