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

%I #5 Jul 19 2013 17:14:47

%S 1,5040,93770800,1891074940160,38746316631586896,

%T 796655971557156062816,16391903881902996952724768,

%U 337320253484345016223956919936,6941648177366735193973359263017216,142850870919946441196223189856661775872,2939698583689917131062885788617101100432640

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

%H Alois P. Heinz, <a href="/A227669/b227669.txt">Table of n, a(n) for n = 0..150</a>

%e a(1) = 7! = 5040.

%Y Column k=7 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 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)