|
Search: id:A105487
|
|
|
| A105487 |
|
Number of partitions of {1...n} containing 5 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. |
|
+0
4
|
|
| 1, 2, 12, 56, 297, 1632, 9531, 58634, 379371, 2574254, 18276457, 135463074, 1046041114, 8399533370, 70013963418, 604840440328, 5407301690915, 49958478263502, 476403955991034, 4683463406478004, 47414166201239781
(list; graph; listen)
|
|
|
OFFSET
|
7,2
|
|
|
REFERENCES
|
A. O. Munagi, Set Partitions with Successions and Separations, Int. J. Math and Math. Sc. 2005, no. 3 (2005), 451-463.
|
|
LINKS
|
A. O. Munagi, Set Partitions with Successions and Separations,IJMMS 2005:3 (2005),451-463.
|
|
FORMULA
|
a(n)=Sum(c(n, k, 5), k=1...n), where c(n, k, 5) is the case r=5 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(binomial(n-j, j)*S2(n-j-1, k-1), j= 0..floor(n/2)).
|
|
EXAMPLE
|
a(8) = 2 because the partitions of {1,...,8} with 5 strings of 3 consecutive integers are 1234567/8, 1/2345678.
|
|
MAPLE
|
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: A105487 := proc(n) local k ; add(c(n, k, 5), k=1..n) ; end: for n from 7 to 30 do printf("%d, ", A105487(n)) ; od ; - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 20 2007
|
|
CROSSREFS
|
Cf. A105486, A105482.
Adjacent sequences: A105484 A105485 A105486 this_sequence A105488 A105489 A105490
Sequence in context: A078543 A084128 A044047 this_sequence A098453 A067125 A005038
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
A. O. Munagi (amunagi(AT)yahoo.com), Apr 10 2005
|
|
EXTENSIONS
|
More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 20 2007
|
|
|
Search completed in 0.002 seconds
|
