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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A268850 Number of sequences with 7 copies each of 1,2,...,n and longest increasing subsequence of length n. 3
 1, 1, 3431, 397222288, 460827731023773, 2931247600219365331976, 70803267480031877368227941803, 5078529731893937404909347067888886466, 909546798992441266072332791609067485208949369, 358281333933096129012031117609647623312585201668494007 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Alois P. Heinz, Table of n, a(n) for n = 0..80 J. D. Horton and A. Kurn, Counting sequences with complete increasing subsequences, Congressus Numerantium, 33 (1981), 75-80. MR 681905 FORMULA a(n) ~ sqrt(7) * (7^7/6!)^n * n^(6*n) / exp(6*(n+1)). - Vaclav Kotesovec, Mar 03 2016 MATHEMATICA Table[Sum[Sum[Sum[Sum[Sum[Sum[k!/(i1!*i2!*i3!*i4!*i5!*i6!*(k - i1 - i2 - i3 - i4 - i5 - i6)!)*(7*k)!/(i1 + 2*i2 + 3*i3 + 4*i4 + 5*i5 + 6*i6 + 7*(k - i1 - i2 - i3 - i4 - i5 - i6))!*(-1)^(i1 + 2*i2 + 3*i3 + 4*i4 + 5*i5 + 6*i6 + 7*(k - i1 - i2 - i3 - i4 - i5 - i6) - k)/(720^i1*120^i2*24^i3*6^i4*2^i5), {i6, 0, k - i1 - i2 - i3 - i4 - i5}], {i5, 0, k - i1 - i2 - i3 - i4}], {i4, 0, k - i1 - i2 - i3}], {i3, 0, k - i1 - i2}], {i2, 0, k - i1}], {i1, 0, k}], {k, 0, 10}] (* Vaclav Kotesovec, Mar 02 2016, after Horton and Kurn *) CROSSREFS Row n=7 of A047909. Sequence in context: A179427 A031787 A228674 * A290290 A024751 A024759 Adjacent sequences:  A268847 A268848 A268849 * A268851 A268852 A268853 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 22 10:13 EST 2022. Contains 350481 sequences. (Running on oeis4.)