A268844 Number of sequences with n copies each of 1,2,...,8 and longest increasing subsequence of length 8.

1, 192621953, 8445885515991841, 211301962987912098409729, 3969183064899133655031651559801, 63178476289432401423971737795658030945, 909546798992441266072332791609067485208949369, 12324197596430667064913735085330208112438377122058241

Offset: 1

Author

Alois P. Heinz, Feb 14 2016

Keywords

• nonn

Links

• Alois P. Heinz, Table of n, a(n) for n = 1..60
• J. D. Horton and A. Kurn, Counting sequences with complete increasing subsequences, Congressus Numerantium, 33 (1981), 75-80. MR 681905

Crossrefs

Column k=8 of A047909.

Formula

a(n) ~ 8^(8*n + 1/2) / (2*Pi*n)^(7/2). - Vaclav Kotesovec, Mar 03 2016