# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a212968
Showing 1-1 of 1

%I A212968 #12 Jun 18 2017 02:26:44
%S A212968 1,5,17,38,75,127,203,300,429,585,781,1010,1287,1603,1975,2392,2873,
%T A212968 3405,4009,4670,5411,6215,7107,8068,9125,10257,11493,12810,14239,
%U A212968 15755,17391,19120,20977,22933,25025,27222,29563,32015,34619,37340
%N A212968 Number of (w,x,y) with all terms in {0,...,n} and w>=range{w,x,y}.
%C A212968 a(n)+A212967(n) = (n+1)^3.
%C A212968 For a guide to related sequences, see A212959.
%H A212968 <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (2,1,-4,1,2,-1).
%F A212968 a(n) = (n+1)*(14*n*(n+2)+3*(-1)^n+21)/24.
%F A212968 a(n) = 2*a(n-1)+a(n-2)-4*a(n-3)+a(n-4)+2*a(n-5)-a(n-6).
%F A212968 G.f.: f(x)/g(x), where f(x) = 1 + 3*x + 6*x^2 + 3*x^3 + x^4 and g(x) = ((1-x)^4)(1+x)^2.
%t A212968 t = Compile[{{n, _Integer}}, Module[{s = 0},
%t A212968 (Do[If[w >= (Max[w, x, y] - Min[w, x, y]), s = s + 1],
%t A212968 {w, 0, n}, {x, 0, n}, {y, 0, n}]; s)]];
%t A212968 Map[t[#] &, Range[0, 60]]   (* A212968 *)
%Y A212968 Cf. A212959.
%K A212968 nonn,easy
%O A212968 0,2
%A A212968 _Clark Kimberling_, Jun 02 2012

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE