login
This site is supported by donations to The OEIS Foundation.

 

Logo


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

%I

%S 1,128,491825,12509563082,1026843977181745,187978502469162658572,

%T 61845760669881132413037769,31862864761563509123808857974124,

%U 23408169635197679203800470649923362577,22939433009552344381207995985855864376139032

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

%p b:= proc(l) option remember; `if`(l[-1]=0, 1, add(add(b(subsop(

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

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

%Y Row n=8 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 21 22:02 EDT 2019. Contains 325210 sequences. (Running on oeis4.)