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 A076165 #21 Dec 13 2018 02:46:40
%S A076165 14467,14476,14647,14674,14746,14764,16447,16474,16744,17446,17464,
%T A076165 17644,41467,41476,41647,41674,41746,41764,44167,44176,44617,44671,
%U A076165 44716,44761,46147,46174,46417,46471,46714,46741,47146,47164,47416
%N A076165 Numbers n such that sum of cubes of even digits of n equals sum of cubes of odd digits of n.
%C A076165 Minimal number of digits in n is 5.
%C A076165 n such that sum of even digits equals sum of odd digits in A036301.
%H A076165 Marius A. Burtea, <a href="/A076165/b076165.txt">Table of n, a(n) for n = 1..5880</a>
%e A076165 14467 is OK because 1^3+7^3=4^3+4^3+6^3.
%t A076165 oeQ[n_]:=Module[{idn = IntegerDigits[n]},Total[Select[idn, OddQ]^3] == Total[Select[idn, EvenQ]^3]]; Select[Range[100000],oeQ] (* _Harvey P. Dale_, Sep 23 2011 *)
%o A076165 (PARI) ok(n)={my(v=digits(n)); sum(i=1, #v, v[i]^3*if(v[i]%2, 1, -1))==0} \\ _Andrew Howroyd_, Dec 10 2018
%Y A076165 Cf. A036301, A076166.
%K A076165 nonn,base
%O A076165 1,1
%A A076165 _Zak Seidov_, Nov 01 2002