login
A079807
Number of multiples of 3 that can be formed by permuting the digits of n.
1
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, 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, 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
OFFSET
0,13
LINKS
EXAMPLE
a(12) = 2: (12,21)
MATHEMATICA
Table[Count[FromDigits/@Permutations[IntegerDigits[n]], _?(Divisible[ #, 3]&)], {n, 0, 110}] (* Harvey P. Dale, Apr 22 2019 *)
CROSSREFS
Cf. A079806.
Sequence in context: A343493 A095808 A281453 * A363887 A341776 A116373
KEYWORD
base,easy,nonn
AUTHOR
Amarnath Murthy, Feb 06 2003
EXTENSIONS
More terms from Sam Alexander, Feb 26 2005
STATUS
approved