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