login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A166863 a(1)= 1; a(2)= 5; thereafter a(n)= a(n-1) + a(n-2) + 5. 5
1, 5, 11, 21, 37, 63, 105, 173, 283, 461, 749, 1215, 1969, 3189, 5163, 8357, 13525, 21887, 35417, 57309, 92731, 150045, 242781, 392831, 635617, 1028453, 1664075, 2692533, 4356613, 7049151, 11405769, 18454925, 29860699, 48315629, 78176333, 126491967 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 1..1000

Index entries for linear recurrences with constant coefficients, signature (2,0,-1)

FORMULA

a(n) = A154691(n) - 2 = 2*A000045(n+3) - 5. - R. J. Mathar, Oct 26 2009

From R. J. Mathar, Oct 26 2009: (Start)

a(n) = 2*a(n-1) - a(n-3).

G.f: x*(1+3*x+x^2)/((x-1)* (x^2+x-1)). (End)

a(n+1) = a(n) + 2*A000045(n+2). - Reinhard Zumkeller, Nov 17 2013

EXAMPLE

For n = 3, a(n) = 5 + 1 + 5 = 11.

MATHEMATICA

Fibonacci[Range[4, 4! ]]*2-5 (* Vladimir Joseph Stephan Orlovsky, Mar 19 2010 *)

PROG

(Haskell)

a166863 n = a166863_list !! (n-1)

a166863_list = 1 : zipWith (+) a166863_list (drop 3 $ map (* 2) a000045_list)

-- Reinhard Zumkeller, Nov 17 2013

CROSSREFS

Cf. A001595, A154691.

Sequence in context: A164096 A298785 A163787 * A163704 A131898 A168642

Adjacent sequences:  A166860 A166861 A166862 * A166864 A166865 A166866

KEYWORD

easy,nonn

AUTHOR

Geoff Ahiakwo, Oct 22 2009

EXTENSIONS

Missing value for a(29) inserted by Reinhard Zumkeller, Nov 17 2013

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 20 08:05 EST 2020. Contains 332069 sequences. (Running on oeis4.)