%I A083093
%S A083093 1,1,1,1,2,1,1,0,0,1,1,1,0,1,1,1,2,1,1,2,1,1,0,0,2,0,0,1,1,1,0,2,2,0,1,
%T A083093 1,1,2,1,2,1,2,1,2,1,1,0,0,0,0,0,0,0,0,1,1,1,0,0,0,0,0,0,0,1,1,1,2,1,0,
%U A083093 0,0,0,0,0,1,2,1,1,0,0,1,0,0,0,0,0,1,0,0,1,1,1,0,1,1,0,0,0,0,1,1,0,1,1
%N A083093 Triangle formed by reading Pascal's triangle (A007318) mod 3.
%C A083093 Start with [1], repeatedly apply the map 0 -> [000/000/000], 1 -> [111/
               120/100], 2 -> [222/210/200] . [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), 
               Apr 16 2009]
%D A083093 Y. Moshe, The density of 0's in recurrence double sequences, J. Number 
               Theory, 103 (2003), 109-121.
%D A083093 Y. Moshe, The distribution of elements in automatic double sequences, 
               Discr. Math., 297 (2005), 91-103.
%F A083093 T(i, j)=binomial(i, j) mod 3
%e A083093 Triangle begins:
%e A083093 1
%e A083093 1 1
%e A083093 1 2 1
%e A083093 1 0 0 1
%e A083093 1 1 0 1 1
%e A083093 1 2 1 1 2 1
%t A083093 Mod[ Flatten[ Table[ Binomial[n, k], {n, 0, 13}, {k, 0, n}]], 3] (from 
               Robert G. Wilson v Jan 19 2004)
%Y A083093 Cf. A007318, A051638 (partial sums), A090044, A047999, A034931, A034930, 
               A008975, A034932.
%Y A083093 Sequence in context: A056979 A087812 A113045 this_sequence A015794 A011650 
               A016357
%Y A083093 Adjacent sequences: A083090 A083091 A083092 this_sequence A083094 A083095 
               A083096
%K A083093 easy,nonn,tabl
%O A083093 0,5
%A A083093 Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 22 2003