|
%I #4 Jul 25 2018 16:41:54
%S 19391512145,1367267690953,57188581537971,2006576231088264,
%T 65823539327956911,2066450841399035025,63056350327027739274,
%U 1900463594609383889937,57088794679037177345346,1717519261928956311195227,51966007918370324842446184,1586467824560962829102119877
%N Number of permutations of [n] with exactly eight increasing runs of even length.
%H Alois P. Heinz, <a href="/A317288/b317288.txt">Table of n, a(n) for n = 16..469</a>
%p b:= proc(u, o, t) option remember; series(`if`(u+o=0, x^t,
%p add(b(u+j-1, o-j, irem(t+1, 2)), j=1..o)+
%p add(b(u-j, o+j-1, 0)*x^t, j=1..u)), x, 9)
%p end:
%p a:= n-> coeff(b(n, 0$2), x, 8):
%p seq(a(n), n=16..30);
%Y Column k=8 of A097592.
%K nonn
%O 16,1
%A _Alois P. Heinz_, Jul 25 2018
|
