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 A295660 #10 Nov 28 2017 10:28:00 %S A295660 1,1,1,1,1,1,2,1,2,1,2,1,2,2,1,1,1,2,2,1,2,2,3,1,2,2,2,2,3,1,4,1,2,1, %T A295660 2,2,2,2,2,1,2,2,3,2,2,3,4,1,3,2,1,2,3,2,2,2,2,3,4,1,4,4,2,1,2,2,2,1, %U A295660 3,2,3,2,2,2,2,2,4,2,4,1,4,2,3,2,1,3,3,2,3,2,2,3,4,4,2,1,2,3,4,2,3,1,4,2,2 %N A295660 Binary weight of Euler phi: a(n) = A000120(A000010(n)). %H A295660 Antti Karttunen, <a href="/A295660/b295660.txt">Table of n, a(n) for n = 1..65537</a> %H A295660 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a> %F A295660 a(n) = A000120(A000010(n)). %t A295660 Array[DigitCount[EulerPhi@ #, 2, 1] &, 105] (* _Michael De Vlieger_, Nov 27 2017 *) %o A295660 (PARI) A295660(n) = hammingweight(eulerphi(n)); %o A295660 (Scheme) (define (A295660 n) (A000120 (A000010 n))) %Y A295660 Cf. A000010, A000120, A175548, A293516. %Y A295660 Cf. A003401 (gives the positions of ones). %K A295660 nonn %O A295660 1,7 %A A295660 _Antti Karttunen_, Nov 27 2017