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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A022120 Fibonacci sequence beginning 3, 7. 9
3, 7, 10, 17, 27, 44, 71, 115, 186, 301, 487, 788, 1275, 2063, 3338, 5401, 8739, 14140, 22879, 37019, 59898, 96917, 156815, 253732, 410547, 664279, 1074826, 1739105, 2813931, 4553036, 7366967, 11920003, 19286970, 31206973, 50493943, 81700916, 132194859 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

LINKS

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

Tanya Khovanova, Recursive Sequences

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

FORMULA

G.f.: (3+4x)/(1-x-x^2). - Philippe Deléham, Nov 19 2008

a(n) = 4*Fibonacci(n+2) - Fibonacci(n+1). - Gary Detlefs Dec 21 2010

a(n) = round(((15+11*sqrt(5))/10)*((1+sqrt(5))/2)^n + ((15-11*sqrt(5))/10)*((1-sqrt(5))/2)^n). - _Bogart B. Strauss, Oct 27 2013

MATHEMATICA

a={}; b=3; c=7; AppendTo[a, b]; AppendTo[a, c]; Do[b=b+c; AppendTo[a, b]; c=b+c; AppendTo[a, c], {n, 1, 12, 1}]; a (* Vladimir Joseph Stephan Orlovsky, Jul 23 2008 *)

Join[{a=3, b=7}, Table[c=a+b; a=b; b=c, {n, 30}]] (* Zak Seidov, Mar 15 2011 *)

Table[4*Fibonacci[n+2]-Fibonacci[n+1], {n, 0, 30}] (* Zak Seidov, Mar 15 2011 *)

PROG

(PARI) v=vector(100); v[1]=3; v[2]=7; for(i=3, #v, v[i]=v[i-2]+v[i-1]); v \\ Charles R Greathouse IV, Mar 15 2011

CROSSREFS

Cf. A000032.

Sequence in context: A217258 A258864 A111244 * A041191 A041251 A042435

Adjacent sequences:  A022117 A022118 A022119 * A022121 A022122 A022123

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane

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 June 23 02:42 EDT 2017. Contains 288633 sequences.