cp's OEIS Frontend

A227605 Number of lattice paths from {8}^n to {0}^n using steps that decrement one component such that for each point (p_1,p_2,...,p_n) we have p_1<=p_2<=...<=p_n.

%I A227605 #5 Nov 25 2016 04:52:13
%S A227605 1,128,491825,12509563082,1026843977181745,187978502469162658572,
%T A227605 61845760669881132413037769,31862864761563509123808857974124,
%U A227605 23408169635197679203800470649923362577,22939433009552344381207995985855864376139032
%N A227605 Number of lattice paths from {8}^n to {0}^n using steps that decrement one component such that for each point (p_1,p_2,...,p_n) we have p_1<=p_2<=...<=p_n.
%H A227605 Vaclav Kotesovec, <a href="/A227605/b227605.txt">Table of n, a(n) for n = 0..30</a>
%p A227605 b:= proc(l) option remember; `if`(l[-1]=0, 1, add(add(b(subsop(
%p A227605       i=j, l)), j=`if`(i=1, 0, l[i-1])..l[i]-1), i=1..nops(l)))
%p A227605     end:
%p A227605 a:= n-> `if`(n=0, 1, b([8$n])):
%p A227605 seq(a(n), n=0..10);
%Y A227605 Row n=8 of A227578.
%K A227605 nonn
%O A227605 0,2
%A A227605 _Alois P. Heinz_, Jul 17 2013