|
Search: id:A105488
|
|
|
| A105488 |
|
Number of partitions of {1...n} containing 2 detached pairs of consecutive integers, i.e., partitions in which only 1- or 2-strings of consecutive integers can appear in a block and there are exactly two 2-strings. |
|
+0 5
|
|
| 1, 6, 30, 150, 780, 4263, 24556, 149040, 951615, 6378625, 44785620, 328660566, 2515643767, 20044428810, 165955025400, 1425299331992, 12678325080012, 116635133853189, 1108221018960830, 10862073229428120, 109694927532209481
(list; graph; listen)
|
|
|
OFFSET
|
4,2
|
|
|
COMMENT
|
Number of partitions enumerated by A105479 in which the maximal length of consecutive integers in a block is 2.
With offset 2t, number of partitions of {1...N} containing 2 detached strings of t consecutive integers, where N=n+2j, t=2+j, j = 0,1,2,..., i.e., partitions of [n]in which only v-strings of consecutive integers can appear in a block, where v=1 or v=t and there are exactly two t-strings.
Equals the minimum of the sum of the Rand distances over all A000110(n) set partitions of n elements. E.g. a(3) = 6 because over the 5 set partitions of {1, 2, 3} the sum of Rand distances from {{1}, {2}, {3}} to the rest is 6. - Andrey Goder (andy.goder(AT)gmail.com), Dec 08 2006
|
|
REFERENCES
|
A. O. Munagi, Set Partitions with Successions and Separations, Int. J. Math and Math. Sc. 2005, no. 3 (2005), 451-463.
W. Rand. Objective criteria for the evaluation of clustering methods. J. Amer. Stat. Assoc., 66 (336): 846-850, 1971.
|
|
LINKS
|
A. O. Munagi, Set Partitions with Successions and Separations,IJMMS 2005:3 (2005),451-463.
|
|
FORMULA
|
a(n)=binomial(n-2, 2)*Bell(n-3), which is the case r = 2 in the general case of r pairs, d(n, r)=binomial(n-r, r)*Bell(n-r-1), which is the case t=2 of the general formula d(n, r, t)=binomial(n-r*(t-1), r)*B(n-r*(t-1)-1).
|
|
EXAMPLE
|
a(5)=6 because the partitions of {1,2,3,4,5} with 2 detached pairs of consecutive integers are 145/23,125/34,1245/3,12/34/5,12/3/45,1/23/45.
|
|
MAPLE
|
seq(binomial(n-2, 2)*combinat[bell](n-3), n=4..28);
with (combinat): [seq (bell(n)*stirling2(n+1, n), n=1..21)]; - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Apr 18 2007
a:=n->sum(numbcomb (n, 1)*bell(n)/2, j=0..n): seq(a(n), n=1..21); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Apr 25 2007
a:=n->sum(sum(bell(n)/2, j=1..n), k=0..n): seq(a(n), n=1..21); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), May 11 2007
with(combinat): seq(add(add(bell(n)/2, j=1..n), k=0..n), n=1..21); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), May 17 2007
|
|
CROSSREFS
|
Cf. A052889, A105479, A105489, A105484.
Sequence in context: A006818 A006819 A003948 this_sequence A054117 A033132 A022023
Adjacent sequences: A105485 A105486 A105487 this_sequence A105489 A105490 A105491
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
A. O. Munagi (amunagi(AT)yahoo.com), Apr 10 2005
|
|
|
Search completed in 0.002 seconds
|