OFFSET
1,9
COMMENTS
Conjecture: For each k = 3, 4, ..., any integer n > 2*k + 1 can be written as a sum of k positive integers n_1, n_2, ..., n_k such that phi(n_1*n_2*...*n_k) is a k-th power.
Note that 2*k + 2 = (k-1)*2 + 4 with phi(2^(k-1)*4) = 2^k.
See also A237523 for a similar conjecture with k = 2.
LINKS
Zhi-Wei Sun, Table of n, a(n) for n = 1..1500
EXAMPLE
a(4) = 1 since 4 = 1 + 1 + 2 with phi(1*1*2) = 1^3.
a(13) = 1 since 13 = 1 + 2 + 10 with phi(1*2*10) = 2^3.
a(16) = 1 since 16 = 4 + 4 + 8 with phi(4*4*8) = phi(2^7) = 4^3.
MATHEMATICA
CQ[n_]:=IntegerQ[n^(1/3)]
q[n_]:=CQ[EulerPhi[n]]
a[n_]:=Sum[If[q[i*j(n-i-j)], 1, 0], {i, 1, n/3}, {j, i, (n-i)/2}]
Table[a[n], {n, 1, 80}]
CROSSREFS
KEYWORD
nonn
AUTHOR
Zhi-Wei Sun, Feb 09 2014
STATUS
approved