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!)
A227673 Number of lattice paths from {n}^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 #6 Jul 19 2013 17:22:53

%S 1,1,4,320,1281696,482913033152,27297846037161958056,

%T 337320253484345016223956919936,

%U 1248760044848501400078426452469652899962528,1817025580455577353700768095528219275036151622984555026720

%N Number of lattice paths from {n}^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(0) = 1: () .

%e a(1) = 1: (1)-(0) .

%e . (1,2) (0,1)

%e . / \ / \

%e a(2) = 4: (2,2) (1,1) (0,0) .

%e . \ / \ /

%e . (2,1) (1,0)

%Y Main diagonal of A227655.

%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 April 19 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)