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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A227601 Number of lattice paths from {n}^10 to {0}^10 using steps that decrement one component such that for each point (p_1,p_2,...,p_10) we have p_1<=p_2<=...<=p_10. 1
1, 1, 58786, 72686739116, 569413385415535738, 15313737501505148093502344, 1003769793669980634048599763674485, 129559009610760457771091688202936893773393, 28544115728527488452514857447327666866636823456709 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Table of n, a(n) for n=0..8.

MAPLE

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

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

    end:

a:= n-> `if`(n=0, 1, b([n$10])):

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

CROSSREFS

Column k=10 of A227578.

Sequence in context: A251519 A255781 A234447 * A147700 A214118 A157131

Adjacent sequences:  A227598 A227599 A227600 * A227602 A227603 A227604

KEYWORD

nonn

AUTHOR

Alois P. Heinz, Jul 17 2013

STATUS

approved

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 June 12 10:54 EDT 2021. Contains 344947 sequences. (Running on oeis4.)