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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A268843 Number of sequences with n copies each of 1,2,...,7 and longest increasing subsequence of length 7. 3
 1, 6439075, 11260558754404, 12084070123028603391, 10162884447920460534301136, 7465237877942551321425443305798, 5078529731893937404909347067888886466, 3315159778348807570604149155371730111763599, 2124172213523649116114190361767338538457819064671 (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..100 (terms n=1..36 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) ~ 7^(7*n + 1/2) / (2*Pi*n)^3. - Vaclav Kotesovec, Feb 21 2016 CROSSREFS Column k=7 of A047909. Sequence in context: A234758 A295481 A297327 * A254174 A254167 A254456 Adjacent sequences:  A268840 A268841 A268842 * A268844 A268845 A268846 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.

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