The OEIS is supported by the many generous donors to the OEIS Foundation.

 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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A212987 Number of (w,x,y) with all terms in {0,...,n} and 3*w = 2*x+2*y. 2
 1, 1, 3, 5, 8, 10, 16, 18, 25, 29, 37, 41, 52, 56, 68, 74, 87, 93, 109, 115, 132, 140, 158, 166, 187, 195, 217, 227, 250, 260, 286, 296, 323, 335, 363, 375, 406, 418, 450, 464, 497, 511, 547, 561, 598, 614, 652, 668, 709, 725, 767, 785, 828, 846, 892 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS For a guide to related sequences, see A212959. LINKS Index entries for linear recurrences with constant coefficients, signature (0,2,1,-1,-2,0,1). FORMULA a(n) = 2*a(n-2)+a(n-3)-a(n-4)-2*a(n-5)+a(n-7). G.f.: f(x)/g(x), where f(x) = 1 + x + x^2 + 2*x^3 + 2*x^4 and g(x) = (1 + x + x^2)((1+x)^2)((1-x)^3). MATHEMATICA t = Compile[{{n, _Integer}}, Module[{s = 0}, (Do[If[3 w == 2 x + 2 y, s = s + 1], {w, 0, n}, {x, 0, n}, {y, 0, n}]; s)]]; m = Map[t[#] &, Range[0, 70]] (* A212987 *) CROSSREFS Cf. A212959. Sequence in context: A310025 A133097 A117176 * A217919 A127700 A101907 Adjacent sequences: A212984 A212985 A212986 * A212988 A212989 A212990 KEYWORD nonn,easy AUTHOR Clark Kimberling, Jun 04 2012 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 7 15:01 EST 2022. Contains 358667 sequences. (Running on oeis4.)