login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A268844 Number of sequences with n copies each of 1,2,...,8 and longest increasing subsequence of length 8. 3

%I

%S 1,192621953,8445885515991841,211301962987912098409729,

%T 3969183064899133655031651559801,

%U 63178476289432401423971737795658030945,909546798992441266072332791609067485208949369,12324197596430667064913735085330208112438377122058241

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

%H Alois P. Heinz, <a href="/A268844/b268844.txt">Table of n, a(n) for n = 1..60</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) ~ 8^(8*n + 1/2) / (2*Pi*n)^(7/2). - _Vaclav Kotesovec_, Mar 03 2016

%Y Column k=8 of A047909.

%K nonn

%O 1,2

%A _Alois P. Heinz_, Feb 14 2016

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 22 23:50 EST 2022. Contains 350504 sequences. (Running on oeis4.)