|
%I #2 Feb 27 2009 03:00:00
%S 1,6,37,126,287,540,895
%N 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.
%e 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.)
%Y Cf. A000793, A129647, A129648, A129649, A129650.
%K hard,more,nonn
%O 1,2
%A Nickolas Reynolds (nickels(AT)gmail.com), Apr 25 2007, Apr 26 2007, Apr 27 2007
|
