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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A227596 Number of lattice paths from {n}^5 to {0}^5 using steps that decrement one component such that for each point (p_1,p_2,...,p_5) we have p_1<=p_2<=...<=p_5. 2
 1, 1, 132, 49100, 34426812, 36470203156, 51630369256916, 90650832149396184, 187978502469162658572, 445073778727031182727610, 1174228543974568589770758656, 3389786811049267225428045061056, 10559434352810002520295112134863908 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Vaclav Kotesovec, Table of n, a(n) for n = 0..116 FORMULA a(n) ~ 2*sqrt(5) * 6^(5*n+21) / (5^7 * 7^12 * Pi^2 * n^12). - Vaclav Kotesovec, Nov 20 2016 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\$5])): seq(a(n), n=0..13); MATHEMATICA b[l_] := b[l] = If[l[[-1]] == 0, 1, Sum[Sum[b[ReplacePart[l, i -> j]], {j, If[i == 1, 0, l[[i - 1]]], l[[i]] - 1}], {i, 1, Length[l]}]]; a[n_] := If[n == 0, 1, b[Array[n&, 5]]]; a /@ Range[0, 13] (* Jean-François Alcover, Dec 20 2020, after Alois P. Heinz *) CROSSREFS Column k=5 of A227578. Sequence in context: A183500 A146545 A181194 * A267951 A268098 A289294 Adjacent sequences: A227593 A227594 A227595 * A227597 A227598 A227599 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 17 05:50 EDT 2024. Contains 374360 sequences. (Running on oeis4.)