OFFSET
0,3
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..100
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 (8,-7,1,-8,7).
FORMULA
a(n) = round((7*7^n - 6*n + 2)/54) = round((7*7^n - 6*n - 7)/54).
a(n) = floor((7*7^n - 6*n + 11)/54).
a(n) = ceiling((7*7^n - 6*n - 7)/54).
a(n) = a(n-3) + (19*7^(n-2) - 1)/3, n > 2.
a(n) = 8*a(n-1) - 7*a(n-2) + a(n-3) - 8*a(n-4) + 7*a(n-5), n > 4.
G.f.: -x*(1 - 2*x + 3*x^2)/((7*x-1)*(1+x+x^2)*(x-1)^2).
EXAMPLE
a(3) = 0 + 1 + 5 + 38 = 44.
MAPLE
A156002 := proc(n) add( round(7^i/9), i=0..n) ; end proc:
MATHEMATICA
CoefficientList[Series[-x*(1 - 2*x + 3*x^2)/((7*x - 1)*(1 + x + x^2)*(x - 1)^2), {x, 0, 40}], x] (* or *)
LinearRecurrence[{8, -7, 1, -8, 7}, {0, 1, 6, 44, 311}, 40] (* Stefano Spezia, Sep 02 2018 *)
Accumulate[Round[7^Range[0, 20]/9]] (* Harvey P. Dale, Apr 24 2021 *)
PROG
(Magma) [Floor((7*7^n-6*n+11)/54): n in [0..40]]; // Vincenzo Librandi, Apr 27 2011
CROSSREFS
KEYWORD
nonn,easy,less
AUTHOR
Mircea Merca, Dec 28 2010
STATUS
approved