|
|
A362181
|
|
Number of numbers k such that A323410(k) = n.
|
|
8
|
|
|
0, 0, 1, 0, 2, 1, 2, 1, 3, 1, 3, 2, 3, 3, 2, 2, 3, 3, 4, 3, 3, 3, 3, 3, 4, 4, 3, 3, 4, 5, 4, 5, 4, 5, 3, 4, 4, 5, 3, 5, 3, 5, 5, 5, 4, 6, 4, 6, 4, 6, 2, 7, 4, 6, 4, 6, 3, 7, 3, 5, 4, 6, 3, 8, 2, 6, 6, 7, 4, 8, 4, 6, 6, 7, 3, 9, 4, 7, 4, 5, 5, 9, 6, 9, 4, 7, 3
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
2,5
|
|
COMMENTS
|
The offset is 2 since A323410(p) = 1 for all prime powers p (A246655).
a(0) = 1, since there is only one solution, x = 1, to A323410(x) = 0.
|
|
LINKS
|
|
|
FORMULA
|
|
|
MATHEMATICA
|
ucototient[n_] := n - Times @@ (Power @@@ FactorInteger[n] - 1); ucototient[1] = 0; With[{max = 100}, ucot = Table[ucototient[n], {n, 1, max^2}]; Table[Length[Position[ucot, n]], {n, 2, max}] // Flatten]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|