A320443 - cp's OEIS frontend

A320443 Number of lattice paths from {n}^n to {0}^n using steps that decrement one component by 1 such that for each point p we have abs(p_{i}-p_{(i mod n)+1}) <= 1 and the first component used is p_1.

%I A320443 #8 Jan 22 2019 07:33:28
%S A320443 1,1,2,72,162000,34907788800,1178106009360998400,
%T A320443 8852509935316882311338419200,
%U A320443 20266951127950378632425380239663945561600,18451222767137832036294073367248809725255450206074566400,8461986175729341705763214274355536481199826590348664142270203923137228800
%N A320443 Number of lattice paths from {n}^n to {0}^n using steps that decrement one component by 1 such that for each point p we have abs(p_{i}-p_{(i mod n)+1}) <= 1 and the first component used is p_1.
%F A320443 a(n) = A318191(n,n).
%Y A320443 Main diagonal of A318191.
%K A320443 nonn
%O A320443 0,3
%A A320443 _Alois P. Heinz_, Jan 09 2019

cp's OEIS Frontend

A320443 Number of lattice paths from {n}^n to {0}^n using steps that decrement one component by 1 such that for each point p we have abs(p_{i}-p_{(i mod n)+1}) <= 1 and the first component used is p_1.