The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A212763 Number of (w,x,y,z) with all terms in {0,...,n}, and w, x and y odd. 2
 0, 2, 3, 32, 40, 162, 189, 512, 576, 1250, 1375, 2592, 2808, 4802, 5145, 8192, 8704, 13122, 13851, 20000, 21000, 29282, 30613, 41472, 43200, 57122, 59319, 76832, 79576, 101250, 104625, 131072, 135168, 167042, 171955, 209952, 215784 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS For a guide to related sequences, see A211795. LINKS Index entries for linear recurrences with constant coefficients, signature (1,4,-4,-6,6,4,-4,-1,1). FORMULA a(n) = a(n-1) +4*a(n-2) -4*a(n-3) -6*a(n-4) +6*a(n-5) +4*a(n-6) -4*a(n-7) -a(n-8) +a(n-9). G.f.: x*(2+x+21*x^2+4*x^3+18*x^4+x^5+x^6) / ( (1+x)^4*(1-x)^5 ). a(n) = (n+1)*(2*n^3+3*n^2+3*n+1-(3*n^2+3*n+1)*(-1)^n)/16. - Luce ETIENNE, Oct 01 2015 a(n) = A212759(-n-2). [Bruno Berselli, Oct 01 2015] MATHEMATICA t = Compile[{{n, _Integer}}, Module[{s = 0}, (Do[If[(Mod[w, 2] == 1) && (Mod[x, 2] == 1) && (Mod[y, 2] == 1), s++], {w, 0, n}, {x, 0, n}, {y, 0, n}, {z, 0, n}]; s)]]; Map[t[#] &, Range[0, 50]]  (* A212763 *) LinearRecurrence[{1, 4, -4, -6, 6, 4, -4, -1, 1}, {0, 2, 3, 32, 40, 162, 189, 512, 576}, 45] PROG (PARI) a(n) = (n+1)*(2*n^3+3*n^2+3*n+1-(3*n^2+3*n+1)*(-1)^n)/16; vector(100, n, a(n-1)) \\ Altug Alkan, Oct 01 2015 CROSSREFS Cf. A211795, A212759. Sequence in context: A032815 A176894 A041053 * A103108 A107124 A141049 Adjacent sequences:  A212760 A212761 A212762 * A212764 A212765 A212766 KEYWORD nonn,easy AUTHOR Clark Kimberling, May 29 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 20 17:43 EDT 2021. Contains 345199 sequences. (Running on oeis4.)