|
|
A268846
|
|
Number of sequences with n copies each of 1,2,...,10 and longest increasing subsequence of length 10.
|
|
3
|
|
|
1, 248040482741, 9891092676022013399311, 195676681342450229063393365876181, 2683885055441747960475755652405552969614101, 29539005031390270063835072245497576346701114916209911, 282011782951614089942684801199121868144180995938610087493133121
(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
|
|
|
|