A105485 - OEIS

%I #17 May 10 2023 06:16:29

%S 1,2,10,44,215,1112,6141,35968,222659,1451770,9939702,71265036,

%T 533744979,4166533826,33831424388,285213338300,2492259168784,

%U 22538314947452,210639529104328,2031804667766532,20203377516199587,206861906112012524,2178715175981722659

%N Number of partitions of {1...n} containing 3 strings of 3 consecutive integers, where each string is counted within a block and a string of more than 3 consecutive integers are counted three at a time.

%H Augustine O. Munagi, <a href="https://doi.org/10.1155/IJMMS.2005.215">Set Partitions with Successions and Separations</a>, Int. J. Math and Math. Sc., 2005:3 (2005), 451-463.

%F a(n) = Sum_{k=1..n} c(n, k, 3), where c(n, k, 3) is the case r=3 of c(n, k, r) given by c(n, k, r)=c(n-1, k-1, r)+(k-1)c(n-1, k, r)+c(n-2, k-1, r)+(k-1)c(n-2, k, r)+c(n-1, k, r-1)-c(n-2, k-1, r-1)-(k-1)c(n-2, k, r-1), r=0, 1, .., n-k-1, k=1, 2, .., n-2r, c(n, k, 0) = Sum_{j= 0..floor(n/2)} binomial(n-j, j)*S2(n-j-1, k-1).

%e a(6)=2 because the partitions of {1,...,6} with 3 strings of 3 consecutive integers are 12345/6, 1/23456.

%p c := proc(n,k,r) option remember ; local j ; if r =0 then add(binomial(n-j,j)*combinat[stirling2](n-j-1,k-1),j=0..floor(n/2)) ; else if r <0 or r > n-k-1 then RETURN(0) fi ; if n <1 then RETURN(0) fi ; if k <1 then RETURN(0) fi ; RETURN( c(n-1,k-1,r)+(k-1)*c(n-1,k,r)+c(n-2,k-1,r)+(k-1)*c(n-2,k,r) +c(n-1,k,r-1)-c(n-2,k-1,r-1)-(k-1)*c(n-2,k,r-1) ) ; fi ; end: A105485 := proc(n) local k ; add(c(n,k,3),k=1..n) ; end: for n from 5 to 28 do printf("%d, ",A105485(n)) ; od ; # _R. J. Mathar_, Feb 20 2007

%t S2[_, -1] = 0;

%t S2[n_, k_] = StirlingS2[n, k];

%t c[n_, k_, r_] := c[n, k, r] = Which[r == 0, Sum[Binomial[n - j, j]*S2[n - j - 1, k - 1], {j, 0, Floor[n/2]}], r < 0 || r > n - k - 1, 0, n < 1, 0, k < 1, 0, True, c[n - 1, k - 1, r] + (k - 1)*c[n - 1, k, r] + c[n - 2, k - 1, r] + (k - 1)*c[n - 2, k, r] + c[n - 1, k, r - 1] - c[n - 2, k - 1, r - 1] - (k - 1)*c[n - 2, k, r - 1]];

%t A105485[n_] := Sum[c[n, k, 3], {k, 1, n}];

%t Table[A105485[n], {n, 5, 28}] (* _Jean-François Alcover_, May 10 2023, after _R. J. Mathar_ *)

%Y Cf. A105482, A105484, A105489, A105493.

%K nonn

%O 5,2

%A _Augustine O. Munagi_, Apr 10 2005

%E More terms from _R. J. Mathar_, Feb 20 2007