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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A227602 Number of lattice paths from {5}^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, 16, 1257, 238636, 77767945, 36470203156, 22228291051255, 16513520723284922, 14323116388173517180, 14071120934043157192832, 15313737501505148093502344, 18156604289232210133044514152, 23151467541948649805794187113781, 31425801906523386705389663813716908 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

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

FORMULA

a(n) ~ 9 * 5^(5*n + 41/2)  / (2^37 * Pi^2 * n^12). - Vaclav Kotesovec, Nov 21 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([5$n])):

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

CROSSREFS

Row n=5 of A227578.

Sequence in context: A064346 A222888 A113104 * A186856 A000490 A308587

Adjacent sequences:  A227599 A227600 A227601 * A227603 A227604 A227605

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 October 22 04:25 EDT 2019. Contains 328315 sequences. (Running on oeis4.)