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!)
A320443 Number of lattice paths from {n}^n to {0}^n using steps that decrement one component by 1 such that for each point p we have abs(p_{i}-p_{(i mod n)+1}) <= 1 and the first component used is p_1. 1
1, 1, 2, 72, 162000, 34907788800, 1178106009360998400, 8852509935316882311338419200, 20266951127950378632425380239663945561600, 18451222767137832036294073367248809725255450206074566400, 8461986175729341705763214274355536481199826590348664142270203923137228800 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
FORMULA
a(n) = A318191(n,n).
CROSSREFS
Main diagonal of A318191.
Sequence in context: A067689 A308941 A244148 * A079478 A367492 A221709
KEYWORD
nonn
AUTHOR
Alois P. Heinz, Jan 09 2019
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 August 17 05:44 EDT 2024. Contains 375200 sequences. (Running on oeis4.)