login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,13

LINKS

Harvey P. Dale, Table of n, a(n) for n = 0..1000

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 * A341776 A116373 A341777

Adjacent sequences:  A079804 A079805 A079806 * A079808 A079809 A079810

KEYWORD

base,easy,nonn

AUTHOR

Amarnath Murthy, Feb 06 2003

EXTENSIONS

More terms from Sam Alexander, Feb 26 2005

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 21 11:56 EDT 2021. Contains 345363 sequences. (Running on oeis4.)