This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A227579 Number of lattice paths from {n}^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
 1, 1, 5, 290, 456033, 36470203156, 237791136700913751, 184570140930218389159747070, 23408169635197679203800470649923362577, 637028433009539403532335279417025047587902906655768, 4725612998324981086891784010767387049970117446517002416810380479702 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Alois P. Heinz and Vaclav Kotesovec, Table of n, a(n) for n = 0..14 (terms 0..12 from Alois P. Heinz) EXAMPLE a(2) = 5: [(2,2),(0,2),(0,0)], [(2,2),(0,2),(0,1),(0,0)], [(2,2),(1,2),(0,2),(0,0)], [(2,2),(1,2),(0,2),(0,1),(0,0)], [(2,2),(1,2),(1,1),(0,1),(0,0)]. 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\$n])): seq(a(n), n=0..9); CROSSREFS Main diagonal of A227578. Sequence in context: A283569 A252173 A265966 * A257045 A256422 A140016 Adjacent sequences:  A227576 A227577 A227578 * A227580 A227581 A227582 KEYWORD nonn,hard AUTHOR Alois P. Heinz, Jul 16 2013 EXTENSIONS a(13)-a(14) in b-file from Vaclav Kotesovec, Nov 28 2016 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.

Last modified October 19 23:44 EDT 2019. Contains 328244 sequences. (Running on oeis4.)