%I #7 Jul 12 2021 15:25:20
%S 1,1,6,31,146,686,3476,18711,101106,540986,2914396,15949626,88494316,
%T 493812436,2757957496,15432771991,86805867666,490992405026,
%U 2788039913036,15864244837646,90398688107076,516136925025356,2954961007771656,16960102805812986
%N Number of n-step 5-dimensional nonnegative lattice walks starting at the origin and using steps that increment all components or decrement one component by 1.
%H Alois P. Heinz, <a href="/A346226/b346226.txt">Table of n, a(n) for n = 0..125</a>
%F a(n) == 1 (mod 5).
%p b:= proc(n, l) option remember; `if`(n=0, 1, (k-> `if`(n>min(l),
%p add(`if`(l[i]=0, 0, b(n-1, sort(subsop(i=l[i]-1, l)))),
%p i=1..k)+b(n-1, map(x-> x+1, l)), (k+1)^n))(nops(l)))
%p end:
%p a:= n-> b(n, [0$5]):
%p seq(a(n), n=0..27);
%Y Column k=5 of A335570.
%K nonn,walk
%O 0,3
%A _Alois P. Heinz_, Jul 11 2021
|