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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A268845 Number of sequences with n copies each of 1,2,...,9 and longest increasing subsequence of length 9. 3
1, 6536413529, 8167981106765263789, 5426679072605204732028894233, 2599293828638212400913690945686101111, 1025794060996626005769021866749636185341527229, 358281333933096129012031117609647623312585201668494007 (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) ~ 9^(9*n + 1/2) / (2*Pi*n)^4. - Vaclav Kotesovec, Mar 03 2016

CROSSREFS

Column k=9 of A047909.

Sequence in context: A281222 A258365 A127342 * A161160 A242829 A233502

Adjacent sequences:  A268842 A268843 A268844 * A268846 A268847 A268848

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 September 17 08:31 EDT 2019. Contains 327127 sequences. (Running on oeis4.)