login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A317290
Number of permutations of [n] with exactly ten increasing runs of even length.
2
370371188237525, 38563334673062963, 2325983895636537462, 113126812608590106065, 4980791141860424686096, 206198935127851667065607, 8187758750644879282198684, 316873661623427502461383547, 12080329061828597152861716278, 456708256439969037699279918515
OFFSET
20,1
LINKS
MAPLE
b:= proc(u, o, t) option remember; series(`if`(u+o=0, x^t,
add(b(u+j-1, o-j, irem(t+1, 2)), j=1..o)+
add(b(u-j, o+j-1, 0)*x^t, j=1..u)), x, 11)
end:
a:= n-> coeff(b(n, 0$2), x, 10):
seq(a(n), n=20..30);
CROSSREFS
Column k=10 of A097592.
Sequence in context: A011528 A172542 A198803 * A128769 A261150 A181392
KEYWORD
nonn
AUTHOR
Alois P. Heinz, Jul 25 2018
STATUS
approved