|
Search: id:A105482
|
|
|
| A105482 |
|
Number of partitions of {1...n} containing 5 pairs of consecutive integers, where each pair is counted within a block and a string of more than 2 consecutive integers are counted two at a time. |
|
+0
5
|
|
| 1, 6, 42, 280, 1890, 13104, 93786, 694584, 5328180, 42336294, 348272925, 2963993760, 26073738236, 236857536216, 2219777316216, 21441389281680, 213260412549303, 2182163481418536, 22951202450444191, 247914874683742728
(list; graph; listen)
|
|
|
OFFSET
|
6,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) = binomial(n-1, 5)Bell(n-6), the case r = 5 in the general case of r pairs: c(n, r) = binomial(n-1, r)B(n-r-1).
|
|
EXAMPLE
|
a(7) = 6 because the partitions of {1,2,3,4,5,6,7} with 5 pairs of consecutive integers are 123456/7,12345/67,1234/567,123/4567,12/34567,1/234567.
|
|
MAPLE
|
seq(binomial(n-1, 5)*combinat[bell](n-6), n=6..26);
|
|
CROSSREFS
|
Cf. A105481, A105487, A105491.
Sequence in context: A158797 A074429 A062310 this_sequence A157335 A057089 A110711
Adjacent sequences: A105479 A105480 A105481 this_sequence A105483 A105484 A105485
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
A. O. Munagi (amunagi(AT)yahoo.com), Apr 10 2005
|
|
|
Search completed in 0.005 seconds
|
