This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A070816 #16 Jan 04 2017 07:47:34
%S A070816 65537,131074,196611,262148,327685,393222,524296,655370,786444,983055,
%T A070816 1048592,1114129,1310740,1572888,1966110,2097184,2228258,2621480,
%U A070816 3145776,3342387,3932220,4194368,4456516,5242960,5570645,6291552
%N A070816 Solutions to phi(gpf(x)) - gpf(phi(x)) = 65534 = c are special multiples of 65537, x=65537*k, where the largest prime factors of factor k were observed in {2, 3, 5, 17, 257}.
%C A070816 See solutions to other even cases of c [=A070813]: A007283 for 0, A070004 for 2, A070814 for 14, A070815 for 254.
%e A070816 For n = 572662306 = 2*17*257*65537, gpf(n) = 65537, phi(n) = 268435456, commutator[572662306] = phi(65537) - gpf(268435456) = 65536 - 2 = 65534.
%t A070816 pf[x_] := Part[Reverse[Flatten[FactorInteger[x]]], 2] Do[s=EulerPhi[pf[n]]-pf[EulerPhi[n]]; If[Equal[s, 65534], Print[{n, n/65537, pf[n/65537]}]], {n, 3, 1000000}] (* Terms of sequence are n *)
%Y A070816 Cf. A000010, A000215, A006530, A007283, A070002, A070003, A070004, A070777, A070812, A070813.
%K A070816 nonn
%O A070816 1,1
%A A070816 _Labos Elemer_, May 09 2002