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”).

A089067
a(n) = 2*a(n-1) + (-1)^n*a(floor(n/2)); a(1)=1.
4
1, 3, 5, 13, 23, 51, 97, 207, 401, 825, 1627, 3305, 6559, 13215, 26333, 52873, 105539, 211479, 422557, 845939, 1691053, 3383733, 6765839, 13534983, 27066661, 54139881, 108273203, 216559621, 433106027, 866238387, 1732450441, 3464953755, 6929854637, 13859814813
OFFSET
1,2
LINKS
FORMULA
Lim_{n->infinity} a(n)/2^n = 0.8067474....
G.f. A(x) satisfies (1 + A(x))/(1 + A(x^2)) = (1-x)/(1-2*x). - Gary W. Adamson, Feb 18 2010, edited by Andrew Howroyd, Jun 05 2021
EXAMPLE
a(2) = 2*1 + 1 = 3;
a(3) = 2*3 - 1 = 5;
a(4) = 2*5 + 3 = 13;
a(5) = 2*13 - 3 = 23;
a(6) = 2*23 + 5 = 51;
a(7) = 2*51 - 5 = 97;
...
PROG
(PARI) seq(n)={my(a=vector(n)); a[1]=1; for(n=2, n, a[n] = 2*a[n-1] + (-1)^n*a[floor(n/2)]); a} \\ Andrew Howroyd, Jun 05 2021
CROSSREFS
Cf. A011782.
Sequence in context: A309703 A240070 A045414 * A339888 A026733 A005824
KEYWORD
easy,nonn
AUTHOR
Philippe Deléham, Dec 02 2003
EXTENSIONS
a(31) corrected and terms a(32) and beyond from Andrew Howroyd, Jun 05 2021
STATUS
approved