login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A227604 Number of lattice paths from {7}^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, 64, 65445, 312077474, 3848596333400, 90650832149396184, 3418868469576233694591, 184570140930218389159747070, 13220723286785303728967102618052, 1190606938488172095512348078940830464, 129559009610760457771091688202936893773393 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Vaclav Kotesovec, Table of n, a(n) for n = 0..38

FORMULA

Conjecture: a(n) ~ 2^4 * 5^2 * 7^(7*n + 85/2) / (6^37 * Pi^3 * n^24). - Vaclav Kotesovec, Nov 23 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([7$n])):

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

CROSSREFS

Row n=7 of A227578.

Sequence in context: A103346 A123394 A069445 * A159677 A013832 A320862

Adjacent sequences:  A227601 A227602 A227603 * A227605 A227606 A227607

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 July 15 22:48 EDT 2019. Contains 325061 sequences. (Running on oeis4.)