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 A096343 #7 Dec 15 2017 17:36:44
%S A096343 1,1,3,4,4,4,4,6,6,1,6,5,10,5,16,14,12,17,22,4,9,21,21,22,18,25,22,21,
%T A096343 15,4,27,28,29,23,32,34,39,38,52,13,45,56,50,53,27,50,44,48,47,18,48,
%U A096343 62,42,47,48,44,57,67,58,31,71,66,63,57,71,67,56,74,70,42,100,89,72,60,75
%N A096343 Number of 1's in binary expansion(product of nonzero digits(n^n)).
%C A096343 Conjecture: a(n) = a(n+1) for infinitely many positive integers. Largest found is n=1091, i.e. n1b(pnd(1091^1091)) = n1b(pnd(1092^1092)) = 1892.
%t A096343 Table[Count[IntegerDigits[Times@@DeleteCases[IntegerDigits[n^n],0],2],1],{n,80}] (* _Harvey P. Dale_, Mar 08 2017 *)
%Y A096343 Cf. A000120, A051801.
%K A096343 base,easy,nonn
%O A096343 0,3
%A A096343 _Jason Earls_, Jun 29 2004