This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A067005 Totient of A061026(n) divided by n. 6
 1, 1, 2, 1, 2, 1, 4, 1, 2, 1, 2, 1, 4, 2, 2, 1, 6, 1, 10, 1, 2, 1, 2, 1, 4, 2, 2, 1, 2, 1, 10, 1, 2, 3, 2, 1, 4, 5, 2, 1, 2, 1, 4, 1, 4, 1, 6, 1, 4, 2, 2, 1, 2, 1, 2, 1, 4, 1, 12, 1, 6, 5, 2, 1, 2, 1, 4, 2, 2, 1, 8, 1, 4, 2, 2, 3, 6, 1, 4, 1, 2, 1, 2, 1, 12, 2, 4, 1, 2, 2, 6, 1, 4, 3, 2, 1, 4, 2, 2, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS Zak Seidov, Table of n, a(n) for n = 1..1000 FORMULA a(n) = A000010(A061026(n))/n. EXAMPLE n = 24: a(24) = 1 = Phi(A061026(24))/24 = Phi(35)/24 = 24/24; n = 85: a(85) = 12 = Phi(A061026(85))/85 = 1020/85. 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!=0: m+=1 ....return m print [totient(k(n))/n for n in xrange(1, 101)] # Indranil Ghosh, Mar 18 2017 CROSSREFS Cf. A000010, A061026, A066674, A066675, A066676, A066677, A066678. Sequence in context: A035400 A235918 A071222 * A230849 A135517 A280726 Adjacent sequences:  A067002 A067003 A067004 * A067006 A067007 A067008 KEYWORD nonn AUTHOR Labos Elemer, Dec 22 2001 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified February 21 04:18 EST 2019. Contains 320371 sequences. (Running on oeis4.)