A011903 a(n) = floor(n*(n-1)*(n-2)/21).

0, 0, 0, 0, 1, 2, 5, 10, 16, 24, 34, 47, 62, 81, 104, 130, 160, 194, 233, 276, 325, 380, 440, 506, 578, 657, 742, 835, 936, 1044, 1160, 1284, 1417, 1558, 1709, 1870, 2040, 2220, 2410, 2611, 2822, 3045, 3280

Offset

0,6

Links

Vincenzo Librandi, Table of n, a(n) for n = 0..1000

Index entries for linear recurrences with constant coefficients, signature (3,-3,1,0,0,0,1,-3,3,-1).

Formula

From R. J. Mathar, Apr 15 2010: (Start)

a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) + a(n-7) - 3*a(n-8) + 3*a(n-9) - a(n-10).

G.f.: x^4*(1-x+2*x^2-x^4+x^5) / ( (1-x)^4*(1+x+x^2+x^3+x^4+x^5+x^6) ). (End)

Mathematica

CoefficientList[Series[x^4*(1-x+2*x^2-x^4+x^5)/((1-x)^3*(1-x^7)), {x, 0, 60}], x] (* Vincenzo Librandi, Jul 07 2012 *)
LinearRecurrence[{3, -3, 1, 0, 0, 0, 1, -3, 3, -1}, {0, 0, 0, 0, 1, 2, 5, 10, 16, 24}, 60] (* Harvey P. Dale, May 03 2023 *)

Prog

(Magma) [Floor(n*(n-1)*(n-2)/21): n in [0..50]]; // Vincenzo Librandi, Jul 07 2012
(SageMath) [2*binomial(n, 3)//7 for n in range(61)] # G. C. Greubel, Oct 18 2024

Crossrefs

Cf. A011886.

Sequence in context: A267159 A084587 A001859 * A078435 A049815 A047992

Adjacent sequences: A011900 A011901 A011902 * A011904 A011905 A011906

Keyword

nonn,easy

Author

N. J. A. Sloane

Status

approved