login

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”).

A212503
Number of (w,x,y,z) with all terms in {1,...,n} and w<2x and y<2z.
2
0, 1, 9, 49, 144, 361, 729, 1369, 2304, 3721, 5625, 8281, 11664, 16129, 21609, 28561, 36864, 47089, 59049, 73441, 90000, 109561, 131769, 157609, 186624, 219961, 257049, 299209, 345744, 398161, 455625, 519841, 589824, 667489, 751689
OFFSET
0,3
COMMENTS
For a guide to related sequences, see A211795.
FORMULA
a(n) = (A077043(n))^2.
a(n) = 2*a(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).
G.f.: x*(1+x+x^2)*(1+6*x+22*x^2+6*x^3+x^4)/((1+x)^3*(1-x)^5). [Bruno Berselli, May 31 2012]
MATHEMATICA
t = Compile[{{n, _Integer}}, Module[{s = 0},
(Do[If[w < 2 x && y < 2 z, s = s + 1],
{w, 1, #}, {x, 1, #}, {y, 1, #}, {z, 1, #}] &[n]; s)]];
Map[t[#] &, Range[0, 40]] (* A212503 *)
LinearRecurrence[{2, 2, -6, 0, 6, -2, -2, 1}, {0, 1, 9, 49, 144, 361, 729, 1369}, 40] (* Harvey P. Dale, Jun 14 2017 *)
CROSSREFS
Cf. A211795.
Sequence in context: A016838 A087691 A014730 * A295019 A164343 A273374
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, May 19 2012
STATUS
approved