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 A052106 #15 Jan 01 2017 17:16:56
%S A052106 0,2,3,4,5,12,7,8,9,30,11,24,13,56,105,16,17,36,19,60,63,132,23,48,25,
%T A052106 182,27,112,29,330,31,32,429,306,385,72,37,380,195,120,41,210,43,264,
%U A052106 315,552,47,96,49,150,969,364,53,108,165,224,399,870,59,660,61,992,189
%N A052106 a(n) = lcm(n, n - phi(n)).
%C A052106 See also A009195, A003277, A050384 when totient and cototient give results identical to each other. This sequence is not identical to A009262.
%C A052106 a(n) = n iff n is in A246655. - _Ivan Neretin_, May 29 2016
%H A052106 Ivan Neretin, <a href="/A052106/b052106.txt">Table of n, a(n) for n = 1..10000</a>
%F A052106 a(n) = lcm(n, A051953(n)).
%e A052106 For n=255, phi(n)=128, cototient(255) = 255 - 128 = 127, a(255) = lcm(255,127) = 32385, while A009262(255) = lcm(255,phi(255)) = 128*255 = 32640;
%e A052106 for n=72, phi(72)=24, A051953(72) = 72 - 24 = 48, a(72) = lcm(72,48) = 144, while A009262(72) = lcm(72,24) = 72.
%t A052106 Table[LCM[n, n - EulerPhi[n]], {n, 63}] (* _Ivan Neretin_, May 29 2016 *)
%Y A052106 Cf. A000010, A009262, A051953.
%K A052106 nonn
%O A052106 1,2
%A A052106 _Labos Elemer_, Jan 20 2000