OFFSET
0,5
COMMENTS
Partial sums of A155803.
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..1000
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 (3,-2,1,-3,2).
FORMULA
a(n) = round((12*2^n - 14*n - 15)/42).
a(n) = round((6*2^n - 7*n - 5)/21).
a(n) = round((6*2^n - 7*n - 10)/21).
a(n) = round((6*2^n - 7*n - 6)/21).
a(n) = a(n-3) + 2^(n-2) - 1, n > 2.
a(n) = 3*a(n-1) - 2*a(n-2) + a(n-3) - 3*a(n-4) + 2*a(n-5), n > 4.
G.f.: -x^3 / ( (2*x-1)*(1 + x + x^2)*(x-1)^2 ). - _R. J. Mathar_, Dec 22 2010
a(n) = floor((2^(n+1))/7) - floor((n+1)/3). - _Ridouane Oudra_, Aug 31 2019
EXAMPLE
a(6) = 0 + 0 + 0 + 1 + 2 + 4 + 9 = 16.
MAPLE
seq(round((6*2^n-7*n-6)/21), n=0..32)
MATHEMATICA
Accumulate[Floor[2^Range[0, 40]/7]] (* or *) LinearRecurrence[{3, -2, 1, -3, 2}, {0, 0, 0, 1, 3}, 40] (* _Harvey P. Dale_, May 02 2015 *)
PROG
(Magma) [Round((12*2^n-14*n-15)/42): n in [0..40]]; // _Vincenzo Librandi_, Jun 23 2011
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
_Mircea Merca_, Dec 22 2010
STATUS
approved