OFFSET
1,2
COMMENTS
Row sums of the triangle A181971. - Reinhard Zumkeller, Jul 09 2012
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 1..1000
Thomas Baruchel, Properties of the cumulated deficient binary digit sum, arXiv:1908.02250 [math.NT], 2019.
Klaus Brockhaus, Illustration for A053646, A081252, A081253 and A081254
Index entries for linear recurrences with constant coefficients, signature (2,1,-2).
FORMULA
a(n) = floor(2^(n-1)*5/3). [corrected by Michel Marcus, Sep 21 2018]
a(n) = a(n-2) + 5*2^(n-3) for n > 2;
a(n+2) - a(n) = A020714(n-1);
a(n) + a(n-1) = A052549(n-1) for n > 1;
a(n+1) - a(n) = A048573(n-1).
G.f.: -(x^2 - x - 1)*x/((x - 1)*(x + 1)*(2*x - 1)).
a(n) = 5*2^(n-1)/3 + (-1)^n/6-1/2. a(n) = 2*a(n-1) + (1+(-1)^n)/2, a(1)=1. - Paul Barry, Mar 24 2003
a(2n) = 2*a(2*n-1) + 1, a(2*n+1) = 2*a(2*n), a(1)=1. a(n) = A000975(n-1) + 2^(n-1). - Philippe Deléham, Oct 15 2006
a(n) - a(n-2) = 2 * (a(n-1) - a(n-3)), with a(0..2)=[1,3,6]. - Yuchun Ji, Mar 18 2020
EXAMPLE
MAPLE
seq(floor(2^(n-1)*5/3), n=1..35); # Muniru A Asiru, Sep 20 2018
MATHEMATICA
Rest@CoefficientList[Series[-(x^2 - x - 1)*x/((x - 1)*(x + 1)*(2*x - 1)), {x, 0, 32}], x] (* Vincenzo Librandi, Apr 04 2012 *)
a[n_]:=Floor[2^(n-1)*5/3]; Array[a, 33, 1] (* Stefano Spezia, Sep 01 2018 *)
PROG
(Magma) [Floor(2^(n-1)*5/3): n in [1..40]]; // Vincenzo Librandi, Apr 04 2012
(PARI) a(n) = 2^(n-1)*5\3; \\ Altug Alkan, Sep 21 2018
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Klaus Brockhaus, Mar 17 2003
STATUS
approved