A227663 - cp's OEIS frontend

A227663 Number of lattice paths from {9}^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 A227663 #5 Jul 19 2013 18:49:32
%S A227663 1,1,512,47437640,98903777810704,2026535155335964884480,
%T A227663 253839841305922000782983605664,
%U A227663 142850870919946441196223189856661775872,290576954131557518350262914717217159752148225600,1817025580455577353700768095528219275036151622984555026720
%N A227663 Number of lattice paths from {9}^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 A227663 a(2) = 2^9 = 512.
%Y A227663 Row n=9 of A227655.
%Y A227663 Cf. A000079.
%K A227663 nonn
%O A227663 0,3
%A A227663 _Alois P. Heinz_, Jul 19 2013

cp's OEIS Frontend

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