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 A211524 #19 Mar 21 2017 10:57:46
%S A211524 0,0,0,0,0,0,0,0,1,1,1,2,2,3,4,4,5,6,7,8,9,10,11,13,14,15,17,18,20,22,
%T A211524 23,25,27,29,31,33,35,37,40,42,44,47,49,52,55,57,60,63,66,69,72,75,78,
%U A211524 82,85,88,92,95,99,103,106,110,114,118,122,126,130,134,139
%N A211524 Number of ordered triples (w,x,y) with all terms in {1,...,n} and w=3x+5y.
%C A211524 For a guide to related sequences, see A211422.
%H A211524 <a href="/index/Rec#order_09">Index entries for linear recurrences with constant coefficients</a>, signature (1, 0, 1, -1, 1, -1, 0, -1, 1).
%F A211524 a(n) = a(n-1)+a(n-3)-a(n-4)+a(n-5)-a(n-6)-a(n-8)+a(n-9).
%F A211524 G.f.: x^8/((1-x)*(1-x^3)*(1-x^5)).
%t A211524 t[n_] := t[n] = Flatten[Table[-w + 3 x + 5 y, {w, 1, n}, {x, 1, n}, {y, 1, n}]]
%t A211524 c[n_] := Count[t[n], 0]
%t A211524 t = Table[c[n], {n, 0, 70}] (* A211524 *)
%t A211524 FindLinearRecurrence[t]
%t A211524 LinearRecurrence[{1,0,1,-1,1,-1,0,-1,1},{0,0,0,0,0,0,0,0,1},69] (* _Ray Chandler_, Aug 02 2015 *)
%Y A211524 Cf. A008672, A211422.
%K A211524 nonn
%O A211524 0,12
%A A211524 _Clark Kimberling_, Apr 14 2012