login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A268846 Number of sequences with n copies each of 1,2,...,10 and longest increasing subsequence of length 10. 3
1, 248040482741, 9891092676022013399311, 195676681342450229063393365876181, 2683885055441747960475755652405552969614101, 29539005031390270063835072245497576346701114916209911, 282011782951614089942684801199121868144180995938610087493133121 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

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

FORMULA

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

CROSSREFS

Column k=10 of A047909.

Sequence in context: A271820 A204781 A288477 * A076254 A213689 A015432

Adjacent sequences:  A268843 A268844 A268845 * A268847 A268848 A268849

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 April 24 22:26 EDT 2019. Contains 322446 sequences. (Running on oeis4.)