OFFSET
1,1
COMMENTS
Always an integer.
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000
Steven Finch and Pascal Sebah, Squares and Cubes Modulo n, arXiv:math/0604465 [math.NT], 2006-2016.
FORMULA
Sum_{k=1..n} ~ c * n / sqrt(log(n)), where c = A271547/sqrt(Pi) (Finch and Sebah, 2006). - Amiram Eldar, Apr 29 2022
MATHEMATICA
a[n_] := EulerPhi[n]/2^(PrimeNu[n] - 1); Array[a, 100] (* Amiram Eldar, Apr 29 2022 *)
PROG
(PARI) for(n=1, 100, print1(2*eulerphi(n)/2^omega(n), ", "))
(Python)
from sympy import totient as phi, primenu as omega
def a(n): return 2*phi(n)//2**omega(n)
print([a(n) for n in range(1, 43)]) # Michael S. Branicky, Apr 29 2022
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Benoit Cloitre, May 12 2002
EXTENSIONS
Offset changed to 1 and a(1) inserted by Amiram Eldar, Apr 29 2022
STATUS
approved