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 A212890 #11 Jun 27 2017 15:46:11
%S A212890 0,14,28,152,276,702,1128,2144,3160,5150,7140,10584,14028,19502,24976,
%T A212890 33152,41328,52974,64620,80600,96580,117854,139128,166752,194376,
%U A212890 229502,264628,308504,352380,406350,460320,525824,591328,669902
%N A212890 Number of (w,x,y,z) with all terms in {0,...,n} and odd range.
%C A212890 a(n) + A212889(n) = (n+1)^4.
%C A212890 For a guide to related sequences, see A211795.
%F A212890 a(n) = 2*a(n-1)+2*a(n-2)-6*a(n-3)+6*a(n-5)-2*a(n-6)-2*a(n-7)+a(n-8).
%F A212890 G.f.: f(x)/g(x), where f(x)=-7*x-34*x^3-7*x^5 and g(x)=((-1+x)^5)*(1+x)^3.
%t A212890 t = Compile[{{n, _Integer}}, Module[{s = 0}, (Do[If[(Mod[#, 2] == 1) &[Max[w, x, y, z] - Min[w, x, y, z]], s++], {w, 0, n}, {x, 0, n}, {y, 0, n}, {z, 0, n}]; s)]];
%t A212890 Map[t[#] &, Range[0, 40]] (* A212890 *)
%t A212890 %/2 (* integers *)
%Y A212890 Cf. A211795, A212889.
%K A212890 nonn,easy
%O A212890 0,2
%A A212890 _Clark Kimberling_, May 30 2012