cp's OEIS Frontend

A227657 Number of lattice paths from {3}^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.

%I A227657 #5 Jul 19 2013 16:54:00
%S A227657 1,1,8,320,33904,7453320,2940381648,1891074940160,1850957806329280,
%T A227657 2618225365541294080,5140671157605632743040,
%U A227657 13563806648374752374753280,46834662679585827124435729920,206992078337280281738792256468480,1149167357682367147108624229192064000
%N A227657 Number of lattice paths from {3}^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 A227657 a(2) = 2^3 = 8:
%e A227657 .     (2,3)       (1,2)       (0,1)
%e A227657 .    /     \     /     \     /     \
%e A227657 (3,3)       (2,2)       (1,1)       (0,0)
%e A227657 .    \     /     \     /     \     /
%e A227657 .     (3,2)       (2,1)       (1,0)
%Y A227657 Row n=3 of A227655.
%Y A227657 Cf. A000079.
%K A227657 nonn
%O A227657 0,3
%A A227657 _Alois P. Heinz_, Jul 19 2013