login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A063741
Smallest number whose inverse cototient set has n elements.
4
10, 0, 4, 8, 23, 35, 47, 59, 63, 83, 89, 113, 143, 119, 197, 167, 279, 233, 281, 209, 269, 323, 299, 359, 497, 329, 455, 605, 389, 461, 479, 419, 539, 599, 509, 755, 791, 713, 875, 797, 719, 629, 659, 1025, 1163, 929, 779, 1193, 1121, 899, 1133, 1091, 839
OFFSET
0,1
COMMENTS
Note that 1 is the only number that has infinitely many cototient-inverses, namely, all the primes.
LINKS
FORMULA
a(n) = min {x: |InvCot(x)| = n}.
a(n) = min { k | A063740(k) = n }. - M. F. Hasler, Jan 11 2018
EXAMPLE
For n = 1, 2, 3, 4, 5, ..., the corresponding inverse sets are as follows: {}, {4}, {6, 8}, {12, 14, 16}, {95, 119, 143, 529}, {75, 155, 203, 299, 323}, ..., {455, 815, 1727, 2567, 2831, 4031, 4247, 4847, 5207, 6431, 6527, 6767, 6887, 7031, 27889}, including 0, 1, 2, 3, 4, 5, ..., 15 numbers.
MATHEMATICA
With[{s = Array[Count[Range[#^2], k_ /; k - EulerPhi@ k == #] &, 300, 2]}, ReplacePart[TakeWhile[First@ FirstPosition[s, #] + 1 & /@ Range[0, Max@ s], IntegerQ], 2 -> 0]] (* Michael De Vlieger, Jan 11 2018 *)
CROSSREFS
Cf. A000010, A051953 (cototient: n - phi(n)), A063507.
Cf. A063740 (number of k such that cototient(k) = n).
Sequence in context: A365893 A062520 A157962 * A320227 A284780 A010681
KEYWORD
nonn
AUTHOR
Labos Elemer, Aug 13 2001
EXTENSIONS
More terms from David Wasserman, Jul 11 2002
STATUS
approved