|
|
A079806
|
|
Number of even numbers that can be formed by permuting the digits of n.
|
|
1
|
|
|
1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 2, 1, 1, 1, 2, 1, 2, 1, 2, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 2, 1, 2, 1, 1, 1, 2, 1, 2, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 2, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 2, 1, 2, 1, 2, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,21
|
|
COMMENTS
|
Derived sequences: (1) smallest k such that a(k) = n; (2) numbers m such that a(m) = m.
|
|
LINKS
|
|
|
EXAMPLE
|
a(246) = 6 (the numbers are 246,264,426,462,624,642). a(384) = 4 (the numbers are 384,348,438,834).
|
|
MATHEMATICA
|
Table[Count[FromDigits/@Permutations[IntegerDigits[n]], _?EvenQ], {n, 0, 120}] (* Harvey P. Dale, Jul 25 2020 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|