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!)
A227671 Number of lattice paths from {n}^9 to {0}^9 using steps that decrement one component by 1 such that for each point (p_1,p_2,...,p_9) we have abs(p_{i}-p_{i+1}) <= 1. 2

%I #5 Jul 19 2013 17:17:26

%S 1,362880,914570667792,2618225365541294080,7716228754248308194763776,

%T 22936896882912935631904962898880,

%U 68371528221534300846360580266415146176,203989890816333447880297347963799273322740544,608787871679690303320891056934368872583827110376320

%N Number of lattice paths from {n}^9 to {0}^9 using steps that decrement one component by 1 such that for each point (p_1,p_2,...,p_9) we have abs(p_{i}-p_{i+1}) <= 1.

%H Alois P. Heinz, <a href="/A227671/b227671.txt">Table of n, a(n) for n = 0..100</a>

%e a(1) = 9! = 362880.

%Y Column k=9 of A227655.

%Y Cf. A000142.

%K nonn

%O 0,2

%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 18 16:22 EDT 2024. Contains 371780 sequences. (Running on oeis4.)