The OEIS is supported by the many generous donors to the OEIS Foundation.

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

%I

%S 1,512,29324405,23076216957520,93462550593036735356,

%T 1174228543974568589770758656,33976468300798036566458244068649205,

%U 1869718376047919275097272876105318640045150,171650174624972457949599385901886660192203614365332

%N 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 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([10\$n])):

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

%Y Row n=10 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 January 22 23:50 EST 2022. Contains 350504 sequences. (Running on oeis4.)