cp's OEIS Frontend

A227606 Number of lattice paths from {9}^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 A227606 #5 Nov 28 2016 02:48:21
%S A227606 1,256,3768209,526701471002,298985252352030713,
%T A227606 445073778727031182727610,1344481798162876850603732892817,
%U A227606 6993293261428532974934599912795818724,55994660641252674524946692511672567020920313,637028433009539403532335279417025047587902906655768
%N A227606 Number of lattice paths from {9}^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 A227606 Vaclav Kotesovec, <a href="/A227606/b227606.txt">Table of n, a(n) for n = 0..25</a>
%p A227606 b:= proc(l) option remember; `if`(l[-1]=0, 1, add(add(b(subsop(
%p A227606       i=j, l)), j=`if`(i=1, 0, l[i-1])..l[i]-1), i=1..nops(l)))
%p A227606     end:
%p A227606 a:= n-> `if`(n=0, 1, b([9$n])):
%p A227606 seq(a(n), n=0..10);
%Y A227606 Row n=9 of A227578.
%K A227606 nonn
%O A227606 0,2
%A A227606 _Alois P. Heinz_, Jul 17 2013