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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A317782 Number of 2n-step paths from (0,0) to (0,n) that stay in the first quadrant (but may touch the axes) consisting of steps (1,0), (0,1), (0,-1) and (-1,1). 3
1, 1, 5, 51, 474, 4329, 43406, 469565, 5228459, 59259957, 686003702, 8097484169, 97005128492, 1175916181703, 14404685872773, 178105648065109, 2220134252592683, 27872257776993240, 352143374331177766, 4474477933645201621, 57147423819800882972 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Alois P. Heinz, Table of n, a(n) for n = 0..500

FORMULA

a(n) = A199915(2n,n).

a(n) ~ c * d^n / n^2, where d = 14.0982628380912972017512943055944... and c = 0.25546328221900708410379626465... - Vaclav Kotesovec, Mar 13 2019

EXAMPLE

a(2) = 5: [(0,1),(0,-1),(0,1),(0,1)], [(0,1),(0,1),(0,-1),(0,1)], [(0,1),(0,1),(0,1),(0,-1)], [(1,0),(-1,1),(1,0),(-1,1)], [(1,0),(1,0),(-1,1),(-1,1)].

MAPLE

b:= proc(n, x, y) option remember; `if`(min(args, n-x-y)<0, 0, `if`(n=0, 1,

      add(b(n-1, x-d[1], y-d[2]), d=[[1, 0], [0, 1], [0, -1], [-1, 1]])))

    end:

a:= n-> b(2*n, 0, n):

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

CROSSREFS

Cf. A199915, A306813.

Sequence in context: A208997 A041043 A145641 * A195211 A106415 A212819

Adjacent sequences:  A317779 A317780 A317781 * A317783 A317784 A317785

KEYWORD

nonn,walk

AUTHOR

Alois P. Heinz, Sep 24 2018

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 December 10 18:10 EST 2019. Contains 329901 sequences. (Running on oeis4.)