|
%I #7 Mar 31 2016 06:12:00
%S 1,1,2,1,6,3,1,21,10,4,1,76,36,15,5,1,281,133,57,21,6,1,1052,499,218,
%T 85,28,7,1,3974,1890,838,339,121,36,8,1,15113,7207,3233,1343,505,166,
%U 45,9,1,57774,27622,12509,5302,2069,726,221,55,10,1,221781,106289
%N Number of set partitions of [n] having the maximal possible number of pairs (m,m+1) such that m+1 is in some block b and m is in block b+1.
%H Alois P. Heinz, <a href="/A270967/b270967.txt">Table of n, a(n) for n = 0..300</a>
%F a(n) = A270953(n,n-floor((1+sqrt(max(0,8*n-7)))/2)).
%Y Cf. A083920, A270953.
%K nonn
%O 0,3
%A _Alois P. Heinz_, Mar 26 2016
|
