cp's OEIS Frontend

A241871 Number of ascent sequences of length 2n with exactly n descents.

%I A241871 #14 Mar 07 2022 13:21:36
%S A241871 1,0,0,1,26,937,45747,2945144,242899690,25034354941,3157647587689,
%T A241871 478931493603308,86057396214591300,18086772915953351382,
%U A241871 4397414569504319733812,1224945090342466220614714,387654163770235904289085798,138333762956844287480268151988
%N A241871 Number of ascent sequences of length 2n with exactly n descents.
%H A241871 Joerg Arndt and Alois P. Heinz, <a href="/A241871/b241871.txt">Table of n, a(n) for n = 0..70</a>
%F A241871 a(n) = A238858(2n,n).
%p A241871 b:= proc(n, i, t) option remember; `if`(n=0, 1, expand(add(
%p A241871       `if`(j<i, x, 1) *b(n-1, j, t+`if`(j>i, 1, 0)), j=0..t+1)))
%p A241871     end:
%p A241871 a:= n-> coeff(b(2*n, -1$2), x, n):
%p A241871 seq(a(n), n=0..20);
%t A241871 b[n_, i_, t_] := b[n, i, t] = If[n == 0, 1, Expand[Sum[If[j<i, x, 1]*b[n-1, j, t + If[j>i, 1, 0]], {j, 0, t+1}]]]; a[n_] := Coefficient[b[2*n, -1, -1], x, n]; Table[ a[n], {n, 0, 20}] (* _Jean-François Alcover_, Feb 13 2015, after Maple *)
%Y A241871 Cf. A238858.
%K A241871 nonn
%O A241871 0,5
%A A241871 _Joerg Arndt_ and _Alois P. Heinz_, May 01 2014