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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A022090 Fibonacci sequence beginning 0, 7. 3
0, 7, 7, 14, 21, 35, 56, 91, 147, 238, 385, 623, 1008, 1631, 2639, 4270, 6909, 11179, 18088, 29267, 47355, 76622, 123977, 200599, 324576, 525175, 849751, 1374926, 2224677, 3599603, 5824280, 9423883, 15248163, 24672046, 39920209, 64592255, 104512464 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

REFERENCES

A. T. Benjamin and J. J. Quinn, Proofs that really count: the art of combinatorial proof, M.A.A. 2003, p. 15.

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

a(n) = round( ((14*phi-7)/5) * phi^n) (works for n>3). - Thomas Baruchel, Sep 08 2004

a(n) = 7*F(n) = F(n+4) + F(n-4) for n>3.

a(n) = A119457(n+5,n-1) for n>1. - Reinhard Zumkeller, May 20 2006

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

MATHEMATICA

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

CROSSREFS

Cf. A000032.

Cf. sequences with formula Fibonacci(n+k)+Fibonacci(n-k) listed in A280154.

Sequence in context: A003872 A168374 A112438 * A245426 A168379 A179886

Adjacent sequences:  A022087 A022088 A022089 * A022091 A022092 A022093

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 April 29 09:07 EDT 2017. Contains 285604 sequences.