Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #16 May 03 2019 08:44:20
%S 0,0,2,24,98,272,608,1184,2092,3440,5350,7960,11422,15904,21588,28672,
%T 37368,47904,60522,75480,93050,113520,137192,164384,195428,230672,
%U 270478,315224,365302,421120,483100,551680,627312,710464,801618
%N Number of (w,x,y,z) with all terms in {1,...,n} and w<|x-y|+|y-z|.
%C a(n) + A212675(n) = n^4.
%C For a guide to related sequences, see A211795.
%H <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (4, -5, 0, 5, -4, 1).
%F a(n) = 4*a(n-1)-5*a(n-2)+5*a(n-4)-4*a(n-5)+a(n-6).
%F G.f.: (2*x^2+16*x^3+12*x^4)/(1-4*x+5*x^2-5*x^4+4*x^5-x^6). [corrected by _Georg Fischer_, May 03 2019]
%t t = Compile[{{n, _Integer}}, Module[{s = 0},
%t (Do[If[w < Abs[x - y] + Abs[y - z], s = s + 1],
%t {w, 1, #}, {x, 1, #}, {y, 1, #}, {z, 1, #}] &[n]; s)]];
%t Map[t[#] &, Range[0, 40]] (* A212568 *)
%t %/2 (* integers *)
%t LinearRecurrence[{4, -5, 0, 5, -4, 1}, {0, 0, 2, 24, 98, 272}, 20]
%Y Cf. A211795.
%K nonn,easy
%O 0,3
%A _Clark Kimberling_, May 23 2012