|
| |
|
|
A082064
|
|
Greatest common prime-divisor of phi(n) and Sigma[1,n]=A000203(n); a(n)=1 if no common prime-divisor was found.
|
|
0
|
|
|
|
1, 1, 2, 1, 2, 2, 2, 1, 1, 2, 2, 2, 2, 3, 2, 1, 2, 3, 2, 2, 2, 2, 2, 2, 1, 3, 2, 2, 2, 2, 2, 1, 2, 2, 3, 1, 2, 3, 2, 2, 2, 3, 2, 2, 3, 2, 2, 2, 3, 1, 2, 2, 2, 3, 2, 3, 2, 2, 2, 2, 2, 3, 2, 1, 3, 2, 2, 2, 2, 3, 2, 3, 2, 3, 2, 2, 3, 3, 2, 2, 1, 2, 2, 2, 2, 3, 2, 5, 2, 3, 2, 2, 2, 2, 3, 2, 2, 3, 3, 1, 2, 2, 2, 3, 3
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,3
|
|
|
LINKS
|
Table of n, a(n) for n=1..105.
|
|
|
MATHEMATICA
|
ffi[x_] := Flatten[FactorInteger[x]] lf[x_] := Length[FactorInteger[x]] ba[x_] := Table[Part[ffi[x], 2*w-1], {w, 1, lf[x]}] f1[x_] := EulerPhi[n]; f2[x_] := DivisorSigma[1, x] Table[Max[Intersection[ba[f1[w]], ba[f2[w]]]], {w, 1, 128}]
|
|
|
CROSSREFS
|
Cf. A006530, A000203, A000010, A082061-A082066.
Sequence in context: A082070 A082902 A123926 * A082055 A073812 A009223
Adjacent sequences: A082061 A082062 A082063 * A082065 A082066 A082067
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Apr 07 2003
|
|
|
STATUS
|
approved
|
| |
|
|
