OFFSET
0,4
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..500
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 (5,-8,7,-3).
FORMULA
a(n) = round((3*3^n - 7)/14).
a(n) = floor((3*3^n - 1)/14).
a(n) = ceiling((3*3^n - 13)/14).
a(n) = a(n-6) + 52*3^(n-5), n > 5.
a(n) = 5*a(n-1) - 8*a(n-2) + 7*a(n-3) - 3*a(n-4), n > 3.
G.f.: x^2/((1 - x)*(1 - 3*x)*(1 - x + x^2)).
a(n) = 3^(n+1)/14 - 1/2 + A174737(n)/7. - R. J. Mathar, Jan 08 2011
EXAMPLE
a(6) = 0 + 0 + 1 + 4 + 12 + 35 + 104 = 156.
MAPLE
A178703 := proc(n) add( round(3^i/7), i=0..n) ; end proc:
MATHEMATICA
Table[Floor[(3^(n+1)-1)/14], {n, 0, 30}] (* G. C. Greubel, Jan 25 2019 *)
PROG
(Magma) [Floor((3*3^n-1)/14): n in [0..30]]; // Vincenzo Librandi, May 01 2011
(PARI) vector(30, n, n--; ((3^(n+1)-1)/14)\1) \\ G. C. Greubel, Jan 25 2019
(Sage) [floor((3^(n+1)-1)/14) for n in (0..30)] # G. C. Greubel, Jan 25 2019
CROSSREFS
KEYWORD
nonn,less,easy
AUTHOR
Mircea Merca, Dec 28 2010
STATUS
approved