|
| |
|
|
A068502
|
|
Composite n such that gcd(sigma(n),n)=gcd(n,phi(n)).
|
|
0
| |
|
|
10, 12, 14, 22, 26, 34, 35, 38, 42, 44, 45, 46, 56, 58, 62, 65, 70, 74, 76, 77, 78, 82, 85, 86, 92, 94, 99, 105, 106, 114, 115, 118, 119, 122, 124, 130, 133, 134, 142, 143, 146, 154, 158, 161, 166, 168, 170, 172, 178, 184, 185, 186, 187, 188, 194, 195, 202, 206
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
MATHEMATICA
| Cases[Range[2, 206], n_ /; !PrimeQ[n] && GCD[Total[Divisors[n]], n] == GCD[n, EulerPhi[n]]] (* Jean-François Alcover, Mar 15 2011 *)
fQ[n_]:=!PrimeQ[n]&&GCD[Total[Divisors[n]], n] == GCD[n, EulerPhi[n]]; Select[Range[2, 206], fQ] (* Zak Seidov Mar 15 2011 *)
|
|
|
CROSSREFS
| Sequence in context: A088170 A189555 A116612 * A109959 A161990 A030591
Adjacent sequences: A068499 A068500 A068501 * A068503 A068504 A068505
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Benoit Cloitre (benoit7848c(AT)orange.fr), Mar 11 2002
|
| |
|
|
