The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A057542 Maximum cycle length in each permutation between A038776[1] and A038776[A000108[n]]. 5
 1, 1, 1, 3, 4, 16, 87, 202, 607, 1441, 4708 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 LINKS MAPLE map(lmax, Bf2DfBinTreePermutationCycleLengths(some_value)); (e.g. 10) bf2df := s -> (btbf2df(binrev(s), 0, 1)/2); # btbf2df and binrev given in A038776 Bf2DfBinTreePermutationCycleLengths := proc(upto_n) local u, n, a, r, b; a := []; for n from 0 to upto_n do b := []; u := (binomial(2*n, n)/(n+1)); for r from 0 to u-1 do b := [op(b), 1+CatalanRank(n, bf2df(CatalanUnrank(n, r)))]; od; a := [op(a), CycleLengths1(b)]; od; RETURN(a); end; CycleLengths1 := b -> [[(nops(b)-convert(map(nops, convert(b, 'disjcyc')), `+`)), `*`, 1], op(map(nops, convert(b, 'disjcyc')))]; last_term := proc(l) local n: n := nops(l); if(0 = n) then ([]) else (op(n, l)): fi: end: lmax := proc(a) local e, z; z := 0; for e in a do if whattype(e) = list then e := last_term(e); fi; if e > z then z := e; fi; od; RETURN(z); end; CROSSREFS Cycle lengths of permutation A038776 given in A038774. Cf. A057543, A057544, A057545. LCM's of all cycles: A060113. Sequence in context: A188116 A300316 A329546 * A252606 A248240 A110983 Adjacent sequences:  A057539 A057540 A057541 * A057543 A057544 A057545 KEYWORD nonn,more AUTHOR Antti Karttunen, Sep 07 2000 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 17 09:32 EST 2020. Contains 330949 sequences. (Running on oeis4.)