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!)
A268841 Number of sequences with n copies each of 1,2,...,5 and longest increasing subsequence of length 5. 3
1, 11389, 50775091, 162588279629, 449363984934526, 1162145520205261219, 2931247600219365331976, 7370846583668954571029069, 18683332440278067962764855531, 47964531978782851644184417448714, 124871404619023570844557764310152386 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Vaclav Kotesovec and Alois P. Heinz, Table of n, a(n) for n = 1..150 (terms n=1..80 from Vaclav Kotesovec)

J. D. Horton and A. Kurn, Counting sequences with complete increasing subsequences, Congressus Numerantium, 33 (1981), 75-80. MR 681905

FORMULA

a(n) ~ 5^(5*n+1/2) / (2*Pi*n)^2. - Vaclav Kotesovec, Feb 21 2016

CROSSREFS

Column k=5 of A047909.

Sequence in context: A272552 A237796 A236983 * A235016 A185768 A082440

Adjacent sequences:  A268838 A268839 A268840 * A268842 A268843 A268844

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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 13 22:39 EDT 2022. Contains 356109 sequences. (Running on oeis4.)