|
|
A193386
|
|
Number of even divisors of phi(n).
|
|
3
|
|
|
0, 0, 1, 1, 2, 1, 2, 2, 2, 2, 2, 2, 4, 2, 3, 3, 4, 2, 3, 3, 4, 2, 2, 3, 4, 4, 3, 4, 4, 3, 4, 4, 4, 4, 6, 4, 6, 3, 6, 4, 6, 4, 4, 4, 6, 2, 2, 4, 4, 4, 5, 6, 4, 3, 6, 6, 6, 4, 2, 4, 8, 4, 6, 5, 8, 4, 4, 5, 4, 6, 4, 6, 9, 6, 6, 6, 8, 6, 4, 5, 4, 6, 2, 6, 6, 4, 6, 6, 6, 6, 9, 4, 8, 2, 9, 5, 10, 4, 8, 6, 6, 5, 4, 8, 8
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,5
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
a(13) = 4 because phi(13) = 12 and the 4 even divisors are { 2, 4, 6, 12}.
|
|
MATHEMATICA
|
f[n_] := Block[{d = Divisors[EulerPhi[n]]}, Count[EvenQ[d], True]]; Table[f[n], {n, 80}]
(* Second program: *)
|
|
PROG
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|