cp's OEIS Frontend

A227607 Number of lattice paths from {10}^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 A227607 #3 Jul 17 2013 17:19:21
%S A227607 1,512,29324405,23076216957520,93462550593036735356,
%T A227607 1174228543974568589770758656,33976468300798036566458244068649205,
%U A227607 1869718376047919275097272876105318640045150,171650174624972457949599385901886660192203614365332
%N A227607 Number of lattice paths from {10}^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.
%p A227607 b:= proc(l) option remember; `if`(l[-1]=0, 1, add(add(b(subsop(
%p A227607       i=j, l)), j=`if`(i=1, 0, l[i-1])..l[i]-1), i=1..nops(l)))
%p A227607     end:
%p A227607 a:= n-> `if`(n=0, 1, b([10$n])):
%p A227607 seq(a(n), n=0..10);
%Y A227607 Row n=10 of A227578.
%K A227607 nonn
%O A227607 0,2
%A A227607 _Alois P. Heinz_, Jul 17 2013