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 A053162 #19 Jan 11 2014 08:10:59
%S A053162 1,10,20,40,80,160,320,322,640,644,1280,1288,2560,2576,5120,5152,
%T A053162 10240,10304,20480,20608,40960,41216,81920,82432,163840,164864,327680,
%U A053162 329728,333634,655360,659456,667268,1310720,1318912,1334536,1378114,2621440
%N A053162 Nonprimes n such that n+cototient(n) is a power of 2.
%C A053162 See especially A053579 and also A053576, A053577.
%H A053162 Donovan Johnson, <a href="/A053162/b053162.txt">Table of n, a(n) for n = 1..100</a>
%F A053162 a(n)+A051953(n) = 2*a(n)-A000010(n) = 2^w for some w and a(n).
%e A053162 Mersenne primes were deleted from set of numbers with similar property. An infinite subset here is m(r)=5*2^r, since Phi[m(r)]=2^(r+1) and a(m(r))=5*2^(r+1)-2^(r+1)=2^(r+3). A different subset includes m = 322,644,1288,.. = Set of {(2^s)*7*23} generating 2^(s+8)=2m-Phi(m) powers of 2.
%o A053162 (PARI) for(n=1, 2621440, if(isprime(n)==0, if(omega((2*n-eulerphi(n))*2)==1, print1(n ", ")))) \\ _Donovan Johnson_, Jan 09 2014
%Y A053162 Cf. A000043, A000668, A001348, A053159.
%K A053162 nonn
%O A053162 1,2
%A A053162 _Labos Elemer_, Feb 29 2000
%E A053162 More terms from _Olaf Voß_, Feb 25 2008