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 A212988 #12 Feb 20 2024 03:37:10 %S A212988 1,1,2,4,7,9,12,16,21,25,30,36,43,49,56,64,73,81,90,100,111,121,132, %T A212988 144,157,169,182,196,211,225,240,256,273,289,306,324,343,361,380,400, %U A212988 421,441,462,484,507,529,552,576,601,625,650,676,703,729,756,784 %N A212988 Number of (w,x,y) with all terms in {0,...,n} and 4*w = x+y. %C A212988 For a guide to related sequences, see A212959. %H A212988 <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1,0,1,-2,1). %F A212988 a(n) = 2*a(n-1)-a(n-2)+a(n-4)-2*a(n-5)+a(n-6). %F A212988 G.f.: f(x)/g(x), where f(x) = 1 - x + x^2 + x^3 %F A212988 and g(x) = (1 + x + x^2 + x^3)(1-x)^3. %t A212988 t = Compile[{{n, _Integer}}, Module[{s = 0}, (Do[If[4 w == x + y, s = s + 1], {w, 0, n}, {x, 0, n}, {y, 0, n}]; s)]]; %t A212988 m = Map[t[#] &, Range[0, 70]] (* A212988 *) %Y A212988 Cf. A212959. %K A212988 nonn,easy %O A212988 0,3 %A A212988 _Clark Kimberling_, Jun 04 2012