OFFSET
0,2
COMMENTS
REFERENCES
M. Bicknell-Johnson and G. E. Bergum, The Generalized Fibonacci Numbers {C(n)}, C(n)=C(n-1)+C(n-2)+K, Applications of Fibonacci Numbers, 1986, pp. 193-205.
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..1000
M. Bicknell, A Primer on the Pell Sequence and related sequences, Fibonacci Quarterly, Vol. 13, No. 4, 1975, pp. 345-349.
A. F. Horadam, Special properties of the sequence W_n(a,b; p,q), Fib. Quart., 5.5 (1967), 424-434.
Hermann Stamm-Wilbrandt, 4 interlaced bisections
Index entries for linear recurrences with constant coefficients, signature (3, -1, -1).
FORMULA
a(n) = 2*a(n-1) + a(n-2) + 1, a(0) = 1, a(1) = 2.
G.f.: (x^2-x+1)/((1-x)(1-2x-x^2)).
Partial sums of A074323. - Paul Barry, Mar 11 2007
a(n) = (sqrt(2)+1)^n*(3/4+sqrt(2)/4)+(sqrt(2)-1)^n*(3/4-sqrt(2)/4)*(-1)^n-1/2; - Paul Barry, Mar 11 2007
a(0)=1, a(1)=2, a(2)=6, a(n)=3*a(n-1)-a(n-2)-a(n-3). [Harvey P. Dale, Oct 15 2011]
a(2*n) = A124124(2*n+1). - Hermann Stamm-Wilbrandt, Aug 03 2014
a(2*n+1) = A006451(2*n+1). - Hermann Stamm-Wilbrandt, Aug 26 2014
a(n) = 7*a(n-2) - 7*a(n-4) + a(n-6), for n>5. - Hermann Stamm-Wilbrandt, Aug 26 2014
2*a(n) = A135532(n+1)-1. - R. J. Mathar, Jan 13 2023
MATHEMATICA
a[0] = 1; a[1] = 2; a[n_] := a[n] = 2a[n - 1] + a[n - 2] + 1; Table[ a[n], {n, 0, 28}] (* Robert G. Wilson v, Nov 04 2004 *)
LinearRecurrence[{3, -1, -1}, {1, 2, 6}, 31] (* Harvey P. Dale, Oct 15 2011 *)
CoefficientList[Series[(x^2 - x + 1)/((1 - x) (1 - 2 x - x^2)), {x, 0, 40}], x] (* Vincenzo Librandi, Aug 14 2014 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Creighton Dement, Oct 30 2004
EXTENSIONS
More terms from Robert G. Wilson v, Nov 04 2004
Definition edited by N. J. A. Sloane, Aug 03 2014
New name from existing formula by Joerg Arndt, Aug 13 2014
STATUS
approved