The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #9 Feb 10 2015 06:57:30
%S 1,11,132,1430,16016,183183,2170168,26682656,341093610,4535113154,
%T 62703599816,901046882736,13446991930372,208232533802370,
%U 3342841274221680,55579584231437200,956172212838496225,17004878491751993700,312343867479847052850,5920144379977393205640
%N Number of ascent sequences of length n with exactly ten flat steps.
%H Joerg Arndt and Alois P. Heinz, <a href="/A242163/b242163.txt">Table of n, a(n) for n = 11..140</a>
%F a(n) ~ Pi^(35/2) / (10! * 6^8 * sqrt(3)*exp(Pi^2/12)) * (6/Pi^2)^n * n! * sqrt(n). - _Vaclav Kotesovec_, Aug 27 2014
%t 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[n, -1, -1], x, 10]; Table[a[n], {n, 11, 30}] (* _Jean-François Alcover_, Feb 10 2015, after A242153 *)
%Y Column k=10 of A242153.
%K nonn
%O 11,2
%A _Joerg Arndt_ and _Alois P. Heinz_, May 05 2014