OFFSET
0,9
COMMENTS
Apart from the initial zeros, the same as A011867.
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..10000
Mircea Merca, Inequalities and Identities Involving Sums of Integer Functions, J. Integer Sequences, Vol. 14 (2011), Article 11.9.1.
Index entries for linear recurrences with constant coefficients, signature (2,-1,0,0,0,0,1,-2,1).
FORMULA
a(n) = round(n*(n-5)/14).
a(n) = floor((n-2)*(n-3)/14).
a(n) = ceiling((n+1)*(n-6)/14).
a(n) = a(n-7) + n - 6, n > 6.
a(n) = +2*a(n-1) - a(n-2) + a(n-7) - 2*a(n-8) + a(n-9). - R. J. Mathar, Nov 30 2010
G.f.: x^7/( (1 + x + x^2 + x^3 + x^4 + x^5 + x^6)*(1-x)^3 ). - R. J. Mathar, Nov 30 2010
EXAMPLE
a(9) = floor(0/7) + floor(1/7) + floor(2/7) + floor(3/7) + floor(4/7) + floor(5/7) + floor(6/7) + floor(7/7) + floor(8/7) + floor(9/7) = 3.
MATHEMATICA
Table[Floor[(n - 2)*(n - 3)/14], {n, 0, 60}] (* G. C. Greubel, Dec 13 2016 *)
PROG
(Magma) [Round(n*(n-5)/14): n in [0..60]]; // Vincenzo Librandi, Jun 22 2011
(PARI) a(n)=(n-2)*(n-3)\14 \\ Charles R Greathouse IV, Sep 24 2015
(Sage) [floor((n-2)*(n-3)/14) for n in (0..60)] # G. C. Greubel, Aug 31 2019
(GAP) List([0..60], n-> Int((n-2)*(n-3)/14)); # G. C. Greubel, Aug 31 2019
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Mircea Merca, Nov 30 2010
STATUS
approved