OFFSET
1,3
LINKS
Zak Seidov, Table of n, a(n) for n = 1..1000
EXAMPLE
MATHEMATICA
Table[m = 1; While[! Divisible[Set[k, EulerPhi@ m], n], m++]; k/n, {n, 100}] (* Michael De Vlieger, Mar 18 2017 *)
PROG
(PARI) for(n=1, 100, s=1; while((e=eulerphi(s))%n>0, s++); print1(e/n ", ")); \\ Zak Seidov, Feb 22 2014
(Python)
from sympy.ntheory import totient
def k(n):
m=1
while totient(m)%n: m+=1
return m
print([totient(k(n))//n for n in range(1, 101)]) # Indranil Ghosh, Mar 18 2017
CROSSREFS
KEYWORD
nonn
AUTHOR
Labos Elemer, Dec 22 2001
STATUS
approved