This site is supported by donations 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
 1, 512, 29324405, 23076216957520, 93462550593036735356, 1174228543974568589770758656, 33976468300798036566458244068649205, 1869718376047919275097272876105318640045150, 171650174624972457949599385901886660192203614365332 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS 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([10\$n])): seq(a(n), n=0..10); CROSSREFS Row n=10 of A227578. Sequence in context: A016833 A103352 A013848 * A016881 A227663 A016941 Adjacent sequences:  A227604 A227605 A227606 * A227608 A227609 A227610 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.

Last modified July 15 20:24 EDT 2019. Contains 325056 sequences. (Running on oeis4.)