login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A344109
a(n) = (5*2^n + 7*(-1)^n)/3.
0
4, 1, 9, 11, 29, 51, 109, 211, 429, 851, 1709, 3411, 6829, 13651, 27309, 54611, 109229, 218451, 436909, 873811, 1747629, 3495251, 6990509, 13981011, 27962029, 55924051, 111848109, 223696211, 447392429, 894784851, 1789569709, 3579139411, 7158278829, 14316557651, 28633115309, 57266230611, 114532461229, 229064922451
OFFSET
0,1
FORMULA
a(n+1) = 5*2^n - a(n) for n >= 0, with a(0) = 4.
a(n+2) = 5*2^n + a(n) for n >= 0, with a(0) = 4, a(1) = 1.
a(n+3) = 15*2^n - a(n) for n >= 0, with a(0) = 4, a(1) = 1, a(2) = 9.
a(n) = A001045(n+2) + A154879(n).
a(2*n+1) = A321421(n).
a(n) = a(n-1) + 2*a(n-2) for n >= 2. - Pontus von Brömssen, May 09 2021
G.f.: (4 - 3*x)/(1 - x - 2*x^2). - Stefano Spezia, May 10 2021
a(n) = 2*A014551(n) - A001045(n).
a(n) = abs(A156550(n)) - (-1)^n.
a(n+3) = a(n) + 7*A084214(n+1) for n >= 0, with a(0) = 4.
a(n) = 5*A001045(n+1) - A084214(n+1) for n >= 0.
a(n) = A084214(n+1) + 3*(-1)^n for n >= 0.
MATHEMATICA
LinearRecurrence[{1, 2}, {4, 1}, 28] (* Amiram Eldar, May 10 2021 *)
KEYWORD
nonn,easy
AUTHOR
Paul Curtz, May 09 2021
STATUS
approved