The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A070815 Solutions to phi(gpf(x)) - gpf(phi(x)) = 254 = c are special multiples of 257, x = 257k, where largest prime factors of factor k were observed from {2, 3, 5, 17}. See solutions to other even cases of c (=A070813): A007283 for 0, A070004 for 2, A070814 for 14, A070816 for 65534. 4
257, 514, 771, 1028, 1285, 1542, 2056, 2570, 3084, 3855, 4112, 4369, 5140, 6168, 7710, 8224, 8738, 10280, 12336, 13107, 15420, 16448, 17476, 20560, 21845, 24672, 26214, 30840, 32896, 34952, 41120, 43690, 49344, 52428, 61680, 65535, 65792 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
EXAMPLE
For n = 87380 = 4*5*17*257, gpf(n) = 257, phi(n) = 65536, commutator[87380] = phi(257) - gpf(65536) = 256 - 2 = 254.
MATHEMATICA
pf[x_] := Part[Reverse[Flatten[FactorInteger[x]]], 2] Do[s=EulerPhi[pf[n]]-pf[EulerPhi[n]]; If[Equal[s, 254], Print[{n, n/257, pf[n/257]}]], {n, 3, 1000000}] (* Terms of sequence are n *)
CROSSREFS
Sequence in context: A301619 A340343 A158231 * A095321 A100633 A007765
KEYWORD
nonn
AUTHOR
Labos Elemer, May 09 2002
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 13 00:07 EDT 2024. Contains 372497 sequences. (Running on oeis4.)