login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A227659 Number of lattice paths from {5}^n to {0}^n using steps that decrement one component by 1 such that for each point (p_1,p_2,...,p_n) we have abs(p_{i}-p_{i+1}) <= 1. 1
1, 1, 32, 16936, 48447504, 482913033152, 12981179566917088, 796655971557156062816, 99184884676523895557447104, 22936896882912935631904962898880, 9200010705455824278689045306643126144, 6059192105645758114515721403170312097489088, 6265311017439732830154018479087530633271635314944 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Table of n, a(n) for n=0..12.

EXAMPLE

a(2) = 2^5 = 32:

.     (4,5)       (3,4)       (2,3)       (1,2)       (0,1)

.    /     \     /     \     /     \     /     \     /     \

(5,5)       (4,4)       (3,3)       (2,2)       (1,1)       (0,0)

.    \     /     \     /     \     /     \     /     \     /

.     (5,4)       (4,3)       (3,2)       (2,1)       (1,0)

CROSSREFS

Row n=5 of A227655.

Cf. A000079.

Sequence in context: A091201 A121913 A016877 * A230914 A232596 A123393

Adjacent sequences:  A227656 A227657 A227658 * A227660 A227661 A227662

KEYWORD

nonn

AUTHOR

Alois P. Heinz, Jul 19 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 December 6 01:25 EST 2021. Contains 349558 sequences. (Running on oeis4.)