|
|
A268844
|
|
Number of sequences with n copies each of 1,2,...,8 and longest increasing subsequence of length 8.
|
|
3
|
|
|
1, 192621953, 8445885515991841, 211301962987912098409729, 3969183064899133655031651559801, 63178476289432401423971737795658030945, 909546798992441266072332791609067485208949369, 12324197596430667064913735085330208112438377122058241
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
J. D. Horton and A. Kurn, Counting sequences with complete increasing subsequences, Congressus Numerantium, 33 (1981), 75-80. MR 681905
|
|
FORMULA
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|