|
Search: id:A066934
|
|
|
| A066934 |
|
Composite solutions of phi(n)==1 (mod bigomega(n)) where phi(n)=A000010(n) is the Euler totient function and bigomega(n)=A001222(n) is the number of prime divisors of n (counted with multiplicity). |
|
+0
1
|
|
| 8, 12, 32, 48, 75, 108, 110, 125, 128, 170, 192, 208, 230, 280, 290, 312, 363, 368, 374, 405, 410, 420, 470, 506, 530, 552, 590, 638, 680, 684, 688, 702, 710, 782, 830, 848, 867, 890, 902, 935, 980, 986, 1008, 1010, 1020, 1032, 1034, 1044, 1070, 1080, 1088
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Trivially, every prime is a solution of the congruence.
|
|
MATHEMATICA
|
bigomega[n_] := Plus@@Last/@FactorInteger[n]; Select[Range[2, 1100], !PrimeQ[ # ]&&Mod[EulerPhi[ # ]-1, bigomega[ # ]]==0&]
|
|
CROSSREFS
|
Sequence in context: A072327 A117802 A083485 this_sequence A137148 A045018 A067681
Adjacent sequences: A066931 A066932 A066933 this_sequence A066935 A066936 A066937
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Jan 24 2002
|
|
EXTENSIONS
|
Edited by Dean Hickerson (dean(AT)math.ucdavis.edu), Jan 27 2002
|
|
|
Search completed in 0.002 seconds
|
