login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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
1, 192621953, 8445885515991841, 211301962987912098409729, 3969183064899133655031651559801, 63178476289432401423971737795658030945, 909546798992441266072332791609067485208949369, 12324197596430667064913735085330208112438377122058241 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

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

FORMULA

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

CROSSREFS

Column k=8 of A047909.

Sequence in context: A267770 A209597 A251514 * A015368 A317287 A132205

Adjacent sequences:  A268841 A268842 A268843 * A268845 A268846 A268847

KEYWORD

nonn

AUTHOR

Alois P. Heinz, Feb 14 2016

STATUS

approved

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 August 11 23:45 EDT 2020. Contains 336434 sequences. (Running on oeis4.)