A227664 - cp's OEIS frontend

A227664 Number of lattice paths from {10}^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 A227664 #3 Jul 19 2013 18:53:05
%S A227664 1,1,1024,345104904,3738507768500896,515791104488454210243072,
%T A227664 533787802709908480895773030991840,
%U A227664 2939698583689917131062885788617101100432640,67615349092818211761363011993295568195043095341810560,5423343272088334681448905520570069990718596808928384073877898816
%N A227664 Number of lattice paths from {10}^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 A227664 a(2) = 2^10 = 1024.
%Y A227664 Row n=10 of A227655.
%Y A227664 Cf. A000079.
%K A227664 nonn
%O A227664 0,3
%A A227664 _Alois P. Heinz_, Jul 19 2013

cp's OEIS Frontend

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