%I #9 Apr 22 2019 14:00:33
%S 1,0,0,1,0,0,1,0,0,1,0,0,2,0,0,2,0,0,2,0,0,2,0,0,2,0,0,2,0,0,2,0,0,1,
%T 0,0,2,0,0,2,0,0,2,0,0,2,0,0,2,0,0,2,0,0,2,0,0,2,0,0,2,0,0,2,0,0,1,0,
%U 0,2,0,0,2,0,0,2,0,0,2,0,0,2,0,0,2,0,0,2,0,0,2,0,0,2,0,0,2,0,0,1,0,0,6,0,0
%N Number of multiples of 3 that can be formed by permuting the digits of n.
%H Harvey P. Dale, <a href="/A079807/b079807.txt">Table of n, a(n) for n = 0..1000</a>
%e a(12) = 2: (12,21)
%t Table[Count[FromDigits/@Permutations[IntegerDigits[n]],_?(Divisible[ #,3]&)],{n,0,110}] (* _Harvey P. Dale_, Apr 22 2019 *)
%Y Cf. A079806.
%K base,easy,nonn
%O 0,13
%A _Amarnath Murthy_, Feb 06 2003
%E More terms from _Sam Alexander_, Feb 26 2005
