OFFSET
1,3
COMMENTS
In fact, phi(m^(2*n) + m^n + 1) is a multiple of 6*n for all m > 1 and n >= 1. This sequence gives the corresponding quotients for m = 2.
LINKS
M. Alekseyev et al., Divisibility of φ(n^(2k) + n^k + 1) by 6k (in Russian), dxdy.ru, 2022.
MATHEMATICA
a[n_]:= EulerPhi[2^(2*n) + 2^n + 1 ]/(6*n); Array[a, 32] (* Stefano Spezia, Sep 25 2024 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Max Alekseyev, Sep 24 2024
STATUS
approved