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 A104641 #10 Aug 14 2018 21:04:22
%S A104641 3,12,18,19,21,47,53,54,67,68,69,72,75,76,78,84,85,87,89,93,216,224,
%T A104641 236,238,243,245,247,249,260,262,275,297,299,301,303,308,309,310,323,
%U A104641 325,326,332,333,343,346,355,356,362,363,371,374,378,382,383,387,388,395,396
%N A104641 Numbers n such that n^3 has equal number of odd and even digits.
%H A104641 G. C. Greubel, <a href="/A104641/b104641.txt">Table of n, a(n) for n = 1..10000</a>
%t A104641 EqedQ[n_]:= Module[{idn3 = IntegerDigits[n^3]}, Count[idn3, _?EvenQ] == Count[idn3, _?OddQ]]; Select[Range[2000], EqedQ] (* _G. C. Greubel_, Aug 14 2018 *)
%o A104641 (PARI) isok(n) = my(d = digits(n^3)); sum(i=1, #d, 1 - (d[i] % 2)) == sum(i=1, #d, d[i] % 2); \\ _Michel Marcus_, Oct 05 2013
%Y A104641 Cf. A104639, A104640.
%K A104641 easy,nonn,base
%O A104641 1,1
%A A104641 _Zak Seidov_, Mar 18 2005