

A129651


a(n) is the smallest position k at which b_n(i)<b_n(i+1) for all i>=k, where b_n(m) is the largest order of a permutation of m elements with exactly n cycles.


4




OFFSET

1,2


LINKS

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


EXAMPLE

a(2)=6 because b_2(6)=5 and b_2(i)<b_2(i+1) for all i>=6. (That is, the largest order of a permutation of i elements with exactly 2 cycles is monotonic increasing starting at i=6.)


CROSSREFS

Cf. A000793, A129647, A129648, A129649, A129650.
Sequence in context: A277726 A346356 A003351 * A097297 A047670 A338708
Adjacent sequences: A129648 A129649 A129650 * A129652 A129653 A129654


KEYWORD

hard,more,nonn


AUTHOR

Nickolas Reynolds (nickels(AT)gmail.com), Apr 25 2007, Apr 26 2007, Apr 27 2007


STATUS

approved



