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!)
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

%I #5 Jul 19 2013 18:49:32

%S 1,1,512,47437640,98903777810704,2026535155335964884480,

%T 253839841305922000782983605664,

%U 142850870919946441196223189856661775872,290576954131557518350262914717217159752148225600,1817025580455577353700768095528219275036151622984555026720

%N 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.

%e a(2) = 2^9 = 512.

%Y Row n=9 of A227655.

%Y Cf. A000079.

%K nonn

%O 0,3

%A _Alois P. Heinz_, Jul 19 2013

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 March 29 03:51 EDT 2024. Contains 371264 sequences. (Running on oeis4.)