|
|
A268852
|
|
Number of sequences with 9 copies each of 1,2,...,n and longest increasing subsequence of length n.
|
|
3
|
|
|
1, 1, 48619, 227749730869, 21364658238692907265, 18683332440278067962764855531, 96042041352156959435669839199503441435, 2124172213523649116114190361767338538457819064671, 161347197004751609388708454579308609212572710243373701247489
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
LINKS
|
J. D. Horton and A. Kurn, Counting sequences with complete increasing subsequences, Congressus Numerantium, 33 (1981), 75-80. MR 681905
|
|
FORMULA
|
|
|
MATHEMATICA
|
Table[Sum[Sum[Sum[Sum[Sum[Sum[Sum[Sum[k!/(i1!*i2!*i3!*i4!*i5!*i6!*i7!*i8!*(k - i1 - i2 - i3 - i4 - i5 - i6 - i7 - i8)!)*(9*k)!/(i1 + 2*i2 + 3*i3 + 4*i4 + 5*i5 + 6*i6 + 7*i7 + 8*i8 + 9*(k - i1 - i2 - i3 - i4 - i5 - i6 - i7 - i8))!*(-1)^(i1 + 2*i2 + 3*i3 + 4*i4 + 5*i5 + 6*i6 + 7*i7 + 8*i8 + 9*(k - i1 - i2 - i3 - i4 - i5 - i6 - i7 - i8) - k)/(8!^i1 * 7!^i2 * 6!^i3 * 5!^i4 * 4!^i5 * 3!^i6 * 2!^i7), {i8, 0, k - i1 - i2 - i3 - i4 - i5 - i6 - i7}], {i7, 0, k - i1 - i2 - i3 - i4 - i5 - i6}], {i6, 0, k - i1 - i2 - i3 - i4 - i5}], {i5, 0, k - i1 - i2 - i3 - i4}], {i4, 0, k - i1 - i2 - i3}], {i3, 0, k - i1 - i2}], {i2, 0, k - i1}], {i1, 0, k}], {k, 0, 10}] (* Vaclav Kotesovec, Mar 02 2016, after Horton and Kurn *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|