The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A275412 Least k such that phi(k*n) = phi(k*n+1), or 0 if no such k exists. 3
 1, 52, 1, 26, 3 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS From Michael De Vlieger, Jul 27 2016: (Start) Terms 6 through 80, with 0 signifying no such k <= 10^6: {0, 375, 13, 55, 0, 45, 0, 8, 180121, 1, 2054, 15, 0, 116, 0, 125, 482, 2145, 0, 39, 4, 495, 144098, 76, 0, 105, 1027, 15, 37556, 75, 0, 495, 58, 25, 0, 4, 0, 7425, 241, 11, 2294, 178425, 0, 8475, 0, 5, 2, 5415, 0, 9, 72049, 65, 38, 976, 0, 944, 1702, 915, 761, 15, 0, 161175, 18778, 715, 0, 165, 0, 8, 1426, 13, 29, 20451, 0, 416, 0}. n such that a(n) = 0 in above data: {6, 10, 12, 18, 20, 24, 30, 36, 40, 42, 48, 50, 54, 60, 66, 70, 72, 78, 80}, i.e., multiples of 2 and 3, and 2 and 5. (End) If a(n) = 0, then a(m*n) = 0 for all m > 0. If c is a divisor of a(n), then a(c*n) = a(n)/c. Conjecture: If A275337(n) = 0, then a(n) = 0. - Chai Wah Wu, Jul 27 2016 LINKS FORMULA a(A001274(n)) = 1. EXAMPLE a(2) = 52 because phi(52*2) = phi(52*2+1). MATHEMATICA Table[k = 1; While[EulerPhi[k n] != EulerPhi[k n + 1], k++]; k, {n, 5}] (* Michael De Vlieger, Jul 27 2016 *) PROG (PARI) a(n) = {my(k = 1); while (eulerphi(k*n) != eulerphi(k*n+1), k++); k; } CROSSREFS Cf. A000010, A001274, A275337. Sequence in context: A308235 A022079 A230107 * A100990 A298573 A048365 Adjacent sequences:  A275409 A275410 A275411 * A275413 A275414 A275415 KEYWORD nonn,more AUTHOR Altug Alkan, Jul 27 2016 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 August 4 14:11 EDT 2020. Contains 336201 sequences. (Running on oeis4.)