OFFSET
0,3
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..160
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 (6,-4,-6,5).
FORMULA
a(n) = round((5*5^n + 4*n - 1)/32) = round((5*5^n + 4*n - 5)/32).
a(n) = floor((5*5^n + 4*n + 3)/32).
a(n) = ceiling((5*5^n + 4*n - 5)/32).
a(n) = a(n-2) + (3*5^(n-1) + 1)/4 , n > 1.
a(n) = 6*a(n-1) - 4*a(n-2) - 6*a(n-3) + 5*a(n-4), n > 3.
G.f.: (2*x^2-x)/((x+1)*(5*x-1)*(x-1)^2).
a(n) = (5^(n+1) + 4*n - 4*(-1)^n - 1)/32. - Bruno Berselli, Jan 12 2011
EXAMPLE
a(2) = 0 + 1 + 3 = 4.
MAPLE
A178874 := proc(n) add( round(5^i/8), i=0..n) ; end proc:
MATHEMATICA
Accumulate[Round[5^Range[0, 25]/8]] (* Harvey P. Dale, Feb 18 2011 *)
PROG
(Magma) [Floor((5*5^n+4*n+3)/32): n in [0..40]]; // Vincenzo Librandi, Apr 28 2011
CROSSREFS
KEYWORD
nonn,easy,less
AUTHOR
Mircea Merca, Dec 28 2010
STATUS
approved