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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A227597 Number of lattice paths from {n}^6 to {0}^6 using steps that decrement one component such that for each point (p_1,p_2,...,p_6) we have p_1<=p_2<=...<=p_6. 2
 1, 1, 429, 750325, 3086989927, 22228291051255, 237791136700913751, 3418868469576233694591, 61845760669881132413037769, 1344481798162876850603732892817, 33976468300798036566458244068649205, 973569246761047672746215294808240044853 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Vaclav Kotesovec, Table of n, a(n) for n = 0..69 FORMULA Conjecture: a(n) ~ 5 * 7^(6*n+29) / (2^58 * 3^8 * Pi^(5/2) * n^(35/2)). - 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\$6])): seq(a(n), n=0..13); CROSSREFS Column k=6 of A227578. Sequence in context: A258395 A215547 A181195 * A321976 A147694 A166537 Adjacent sequences:  A227594 A227595 A227596 * A227598 A227599 A227600 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 May 16 17:22 EDT 2021. Contains 343949 sequences. (Running on oeis4.)