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

1, 248040482741, 9891092676022013399311, 195676681342450229063393365876181, 2683885055441747960475755652405552969614101, 29539005031390270063835072245497576346701114916209911, 282011782951614089942684801199121868144180995938610087493133121

Offset: 1

Author

Alois P. Heinz, Feb 14 2016

Keywords

• nonn

Links

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

Crossrefs

Column k=10 of A047909.

Formula

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