login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A097657 Fibonacci sequence with first two terms 11 and 23. 3
11, 23, 34, 57, 91, 148, 239, 387, 626, 1013, 1639, 2652, 4291, 6943, 11234, 18177, 29411, 47588, 76999, 124587, 201586, 326173, 527759, 853932, 1381691, 2235623, 3617314, 5852937, 9470251, 15323188, 24793439 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

LINKS

Table of n, a(n) for n=0..30.

Tanya Khovanova, Recursive Sequences

Index entries for linear recurrences with constant coefficients, signature (1, 1).

FORMULA

a(n) = a(n-1) + a(n-2) for n > 1, a(0) = 11, a(1) = 23.

G.f.: (11 + 12*x)/(1 - x - x^2). - Philippe Deléham, Nov 20 2008

a(n) = h*Fibonacci(n+k) + Fibonacci(n+k-h) with h=7, k=3. - Bruno Berselli, Feb 20 2017

MATHEMATICA

a[0] := 11; a[1] := 23; a[n_] := a[n - 1] + a[n - 2]; Table[a[n], {n, 0, 25}] (* Stefan Steinerberger, Mar 06 2006 *)

PROG

(PARI) a(n)=([0, 1; 1, 1]^n*[11; 23])[1, 1] \\ Charles R Greathouse IV, Feb 20 2017

CROSSREFS

Cf. A000045.

Sequence in context: A090506 A250215 A208326 * A041234 A041549 A136771

Adjacent sequences:  A097654 A097655 A097656 * A097658 A097659 A097660

KEYWORD

nonn,easy

AUTHOR

Parthasarathy Nambi, Sep 20 2004

EXTENSIONS

More terms from Stefan Steinerberger, Mar 06 2006

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified May 22 21:40 EDT 2017. Contains 286906 sequences.