|
%I #14 Feb 26 2019 19:11:48
%S 1,1,2,0,1,1,3,3,3,3,0,2,3,3,2,0,3,3,2,0,3,3,3,3,1,1,0,2,1,1,3,3,3,3,
%T 2,0,3,3,1,1,1,1,0,2,1,1,0,2,1,1,2,0,1,1,1,1,3,3,0,2,3,3,2,0,3,3,2,0,
%U 3,3,1,1,1,1,0,2,1,1,2,0,1,1,2,0,1
%N Motzkin numbers (A001006) mod 4.
%H Robert Israel, <a href="/A299919/b299919.txt">Table of n, a(n) for n = 0..10000</a>
%p f:= rectoproc({(3+3*n)*a(n)+(5+2*n)*a(1+n)+(-4-n)*a(n+2), a(0) = 1, a(1) = 1},a(n),remember):
%p seq(f(n) mod 4, n=0..200); # _Robert Israel_, Mar 16 2018
%t b = DifferenceRoot[Function[{b, n}, {3(n+1) b[n] + (2n+5) b[n+1] == (n+4) b[n+2], b[0] == 1, b[1] == 1}]];
%t a[n_] := Mod[b[n], 4];
%t Table[a[n], {n, 0, 100}] (* _Jean-François Alcover_, Feb 26 2019 *)
%Y Motzkin numbers A001006 read mod 2,3,4,5,6,7,8,11: A039963, A039964, A299919, A258712, A299920, A258711, A299918, A258710.
%K nonn
%O 0,3
%A _N. J. A. Sloane_, Mar 16 2018
|
