The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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. 2

%I

%S 1,256,3768209,526701471002,298985252352030713,

%T 445073778727031182727610,1344481798162876850603732892817,

%U 6993293261428532974934599912795818724,55994660641252674524946692511672567020920313,637028433009539403532335279417025047587902906655768

%N 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 Vaclav Kotesovec, <a href="/A227606/b227606.txt">Table of n, a(n) for n = 0..25</a>

%p i=j, l)), j=`if`(i=1, 0, l[i-1])..l[i]-1), i=1..nops(l)))

%p end:

%p a:= n-> `if`(n=0, 1, b([9\$n])):

%p seq(a(n), n=0..10);

%Y Row n=9 of A227578.

%K nonn

%O 0,2

%A _Alois P. Heinz_, Jul 17 2013

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 27 20:46 EST 2021. Contains 349395 sequences. (Running on oeis4.)