The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A230133 Number of permutations of order n with the length of longest run equal 10. 3
 2, 40, 698, 11908, 206388, 3690960, 68577600, 1327697280, 26812356480, 564796979240, 12403183337690, 283718956204402, 6753363090218970, 167092903876164794, 4292602805804464576, 114374394103260000000, 3157276569203744863200, 90202107365906127228000 (list; graph; refs; listen; history; text; internal format)
 OFFSET 10,1 LINKS Alois P. Heinz, Table of n, a(n) for n = 10..450 MAPLE g:= proc(u, o, t) option remember; `if`(u+o=0, 1,        add(g(o+j-1, u-j, 2), j=1..u) +`if`(t<10,        add(g(u+j-1, o-j, t+1), j=1..o), 0))     end: b:= proc(u, o, t) option remember; `if`(t=10, g(u, o, t),        add(b(o+j-1, u-j, 2), j=1..u)+        add(b(u+j-1, o-j, t+1), j=1..o))     end: a:= n-> add(b(j-1, n-j, 1), j=1..n): seq(a(n), n=10..30); MATHEMATICA length = 10; g[u_, o_, t_] := g[u, o, t] = If[u+o == 0, 1, Sum[g[o + j - 1, u - j, 2], {j, 1, u}] + If[t

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 April 7 00:47 EDT 2020. Contains 333291 sequences. (Running on oeis4.)