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 A212889 #9 Jun 11 2012 02:40:12 %S A212889 1,2,53,104,349,594,1273,1952,3401,4850,7501,10152,14533,18914,25649, %T A212889 32384,42193,52002,65701,79400,97901,116402,140713,165024,196249, %U A212889 227474,266813,306152,354901,403650,463201,522752,594593,666434 %N A212889 Number of (w,x,y,z) with all terms in {0,...,n} and even range. %C A212889 a(n)+A212890(n)=(n+1)^4. For a guide to related sequences, see A211795. %F A212889 a(n)=2a(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 A212889 G.f.: f(x)/g(x), where f(x)=-1-47*x^2-47*x^4-x^6 and g(x)=((-1+x)^5)*(1+x)^3. %t A212889 t = Compile[{{n, _Integer}}, Module[{s = 0}, (Do[If[(Mod[#, 2] == 0) &[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 A212889 Map[t[#] &, Range[0, 40]] (* A212889 *) %Y A212889 Cf. A211795, A212890. %K A212889 nonn,easy %O A212889 0,2 %A A212889 _Clark Kimberling_, May 30 2012