A268846 - OEIS

A268846

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

%I #7 Mar 03 2016 03:03:54

%S 1,248040482741,9891092676022013399311,

%T 195676681342450229063393365876181,

%U 2683885055441747960475755652405552969614101,29539005031390270063835072245497576346701114916209911,282011782951614089942684801199121868144180995938610087493133121

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

%H Alois P. Heinz, <a href="/A268846/b268846.txt">Table of n, a(n) for n = 1..50</a>

%H J. D. Horton and A. Kurn, Counting sequences with complete increasing subsequences, Congressus Numerantium, 33 (1981), 75-80. <a href="http://www.ams.org/mathscinet-getitem?mr=681905">MR 681905</a>

%F a(n) ~ 10^(10*n + 1/2) / (2*Pi*n)^(9/2). - _Vaclav Kotesovec_, Mar 03 2016

%Y Column k=10 of A047909.

%K nonn

%O 1,2

%A _Alois P. Heinz_, Feb 14 2016