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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A227663 Number of lattice paths from {9}^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, 512, 47437640, 98903777810704, 2026535155335964884480, 253839841305922000782983605664, 142850870919946441196223189856661775872, 290576954131557518350262914717217159752148225600, 1817025580455577353700768095528219275036151622984555026720 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

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

EXAMPLE

a(2) = 2^9 = 512.

CROSSREFS

Row n=9 of A227655.

Cf. A000079.

Sequence in context: A013848 A227607 A016881 * A016941 A017013 A017097

Adjacent sequences:  A227660 A227661 A227662 * A227664 A227665 A227666

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 August 9 05:12 EDT 2020. Contains 336319 sequences. (Running on oeis4.)