This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A245666 Number of permutations of length n with longest increasing subsequence of length 10. 2
 1, 100, 5941, 275705, 11110464, 410474625, 14353045401, 484748595081, 16029615164446, 523952747921310, 17044414451764396, 554568496974014588, 18113988555378974988, 595604303387826752023, 19755504320385394380715, 662039152774864970449891 (list; graph; refs; listen; history; text; internal format)
 OFFSET 10,2 LINKS Alois P. Heinz, Table of n, a(n) for n = 10..60 MAPLE h:= proc(l) local n; n:= nops(l); add(i, i=l)! /mul(mul(1+l[i]-j     +add(`if`(l[k]>=j, 1, 0), k=i+1..n), j=1..l[i]), i=1..n) end: g:= (n, i, l)-> `if`(n=0 or i=1, h([l[], 1\$n])^2, `if`(i<1, 0,                 add(g(n-i*j, i-1, [l[], i\$j]), j=0..n/i))): a:= n-> g(n-10, min(n-10, 10), [10]): seq(a(n), n=10..30); CROSSREFS Column k=10 of A047874. Sequence in context: A204081 A053109 A151647 * A210814 A065689 A260859 Adjacent sequences:  A245663 A245664 A245665 * A245667 A245668 A245669 KEYWORD nonn AUTHOR Alois P. Heinz, Jul 28 2014 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 December 9 13:50 EST 2019. Contains 329877 sequences. (Running on oeis4.)