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!)
 A070017 Least numbers m such that GCD of two consecutive values of cototients, i.e., gcd(cototient(m+1), cototient(m)) equals 2n - 1. 0
 2, 9, 38, 392, 135, 120, 362, 116, 745, 1183, 294, 528, 1395, 428, 1378, 2602, 1185, 203, 2313, 3042, 1966, 3549, 1431, 551, 7838, 4076, 473, 2635, 903, 2044, 13178, 942, 6819, 12418, 1188, 2264, 3282, 1775, 1517, 2127, 24380, 2884, 2035, 11481 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS FORMULA a(n) = min{x; A049586(x) = 2n - 1}. EXAMPLE For n=104: 2n - 1 = 207, a(104) = 235148 because A049586(235148) = 207 and it is the smallest such number. Remark that Count[t=Table[f[w],{w,1,100000}],1]=83132. This suggests that majority of values in A049586 equals one. MATHEMATICA With[{s = Array[# - EulerPhi@ # &, 10^5]}, Function[t, MapAt[# + 1 &, TakeWhile[#, # > 0 &], 1] &@ Table[First[FirstPosition[t, n] /. k_ /; MissingQ@ k -> {0}], {n, 1, Max@ t, 2}]]@ Map[GCD @@ # &@ # &, Partition[s, 2, 1]]] (* Michael De Vlieger, Jul 30 2017 *) CROSSREFS Cf. A051953. Sequence in context: A069724 A132961 A278050 * A054129 A037737 A037632 Adjacent sequences:  A070014 A070015 A070016 * A070018 A070019 A070020 KEYWORD nonn AUTHOR Labos Elemer and Benoit Cloitre, Apr 12 2002 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 March 30 06:59 EDT 2020. Contains 333119 sequences. (Running on oeis4.)