The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A260776 Certain directed lattice paths. 2
1, 5, 60, 1001, 19380, 408595, 9104550, 210905400, 5028168132, 122563178210, 3040594338320, 76520801509425, 1948777701739050, 50129821093933224, 1300611345665798320, 33994757853301868560, 894295618431497324900, 23660280955151412585930, 629143806228348421209768 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
See Dziemianczuk (2014) for precise definition.
LINKS
M. Dziemianczuk, On Directed Lattice Paths With Additional Vertical Steps, arXiv preprint arXiv:1410.5747 [math.CO], 2014.
FORMULA
See Dziemianczuk (2014) Equation (36b) with N=3.
From Peter Bala, Mar 30 2020: (Start)
a(n) = (1/n)*C(5*n,2*n-1) for n >= 1.
a(n) = 2*Sum_{k = 0..n} C(3*n+k,n+3*k)*C(n+3*k,k)/(n+2*k+1). Cf. A027307(n) = Sum_{k = 0..n} C(2*n+k,n+2*k)*C(n+2*k,k)/(n+k+1) for n >= 1. (End)
CROSSREFS
Sequence in context: A234528 A277300 A156125 * A128574 A120976 A062980
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, Jul 30 2015
EXTENSIONS
More terms from Lars Blomberg, Aug 01 2015
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 13 00:07 EDT 2024. Contains 372497 sequences. (Running on oeis4.)