|
%I #12 Apr 20 2015 04:23:19
%S 2,2,2,2,1,2,2,0,0,2,2,2,0,2,2,2,1,2,2,1,2,2,0,0,1,0,0,2,2,2,0,1,1,0,
%T 2,2,2,1,2,1,2,1,2,1,2,2,0,0,0,0,0,0,0,0,2,2,2,0,0,0,0,0,0,0,2,2,2,1,
%U 2,0,0,0,0,0,0,2,1,2,2,0,0,2,0,0,0,0,0,2,0,0,2,2,2,0,2,2,0,0,0,0,2,2,0,2,2
%N Triangle read by rows: T(n,k) = A083093 with 1's and 2's interchanged.
%H Y. Moshe, <a href="http://dx.doi.org/10.1016/S0022-314X(03)00103-3">The density of 0's in recurrence double sequences</a>, J. Number Theory, 103 (2003), 109-121; see Fig. 1.
%H Y. Moshe, <a href="http://dx.doi.org/10.1016/j.disc.2005.03.022">The distribution of elements in automatic double sequences</a>, Discr. Math., 297 (2005), 91-103.
%F The negative of Pascal's triangle read mod 3.
%e 2; 2,2; 2,1,2; 2,0,0,2; ...
%t -Mod[ Flatten[ Table[ Binomial[n, k], {n, 0, 13}, {k, 0, n}]], -3] (* _Robert G. Wilson v_, Jan 19 2004 *)
%Y Cf. A007318, A083093.
%K nonn,tabl,easy
%O 0,1
%A _N. J. A. Sloane_, Jan 19 2004
%E Extended by _Robert G. Wilson v_, Jan 19 2004
|
