cp's OEIS Frontend

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.

%I A227669 #5 Jul 19 2013 17:14:47
%S A227669 1,5040,93770800,1891074940160,38746316631586896,
%T A227669 796655971557156062816,16391903881902996952724768,
%U A227669 337320253484345016223956919936,6941648177366735193973359263017216,142850870919946441196223189856661775872,2939698583689917131062885788617101100432640
%N 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.
%H A227669 Alois P. Heinz, <a href="/A227669/b227669.txt">Table of n, a(n) for n = 0..150</a>
%e A227669 a(1) = 7! = 5040.
%Y A227669 Column k=7 of A227655.
%Y A227669 Cf. A000142.
%K A227669 nonn
%O A227669 0,2
%A A227669 _Alois P. Heinz_, Jul 19 2013