|
Search: id:A063741
|
|
|
| A063741 |
|
Smallest number whose InvCotSet has n elements. |
|
+0
3
|
|
| 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
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
a(omega) = 1 because 1 is the only number that has infinitely many cototient-inverses.
|
|
FORMULA
|
a(n)=Min{x; Card[InvCot[x]]=n}
|
|
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.
|
|
CROSSREFS
|
Cf. A000010, A051953, A063507.
Adjacent sequences: A063738 A063739 A063740 this_sequence A063742 A063743 A063744
Sequence in context: A038689 A030000 A062520 this_sequence A010681 A095418 A055961
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Aug 13 2001
|
|
EXTENSIONS
|
More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Jul 11 2002
|
|
|
Search completed in 0.002 seconds
|
