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 A104639 #10 Aug 14 2018 09:00:11
%S A104639 0,1,1,2,1,2,1,1,1,3,0,2,1,3,0,3,1,2,2,4,2,4,2,3,2,1,2,2,3,4,1,3,0,2,
%T A104639 3,4,2,3,0,5,3,4,1,3,1,1,3,2,2,4,2,5,3,3,2,2,1,1,2,5,4,4,4,5,4,4,3,3,
%U A104639 3,4,0,3,2,5,3,3,2,3,2,4,2,2,1,3,3,4,3,4,3,4,0,4,3,4,1,4,2,2,2,6
%N A104639 Number of even digits in n^3.
%H A104639 G. C. Greubel, <a href="/A104639/b104639.txt">Table of n, a(n) for n = 1..10000</a>
%F A104639 a(n) = A196563(n^3). - _Michel Marcus_, Oct 05 2013
%t A104639 Table[Count[IntegerDigits[n^3], _?EvenQ], {n, 100}] (* _G. c. Greubel_, Aug 13 2018 *)
%o A104639 (PARI) a(n) = my(d = digits(n^3)); sum(i=1, #d, 1 - (d[i] % 2)); \\ _Michel Marcus_, Oct 05 2013
%Y A104639 Cf. A104640, A196563.
%K A104639 easy,nonn,base
%O A104639 1,4
%A A104639 _Zak Seidov_, Mar 18 2005