This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A022090 Fibonacci sequence beginning 0 7. 2

%I

%S 0,7,7,14,21,35,56,91,147,238,385,623,1008,1631,2639,4270,6909,11179,

%T 18088,29267,47355,76622,123977,200599,324576,525175,849751,1374926,

%U 2224677,3599603,5824280,9423883,15248163,24672046,39920209,64592255,104512464

%N Fibonacci sequence beginning 0 7.

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

%H Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>

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

%F a(n) = 7F(n) = F(n+4) + F(n-4), n>3.

%F a(n) = A119457(n+5,n-1) for n>1. - _Reinhard Zumkeller_, May 20 2006

%F G.f.: 7x/(1-x-x^2). [From _Philippe DELEHAM_, Nov 20 2008]

%t 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 Orlovsky, Jul 23 2008)

%Y Cf. A000032.

%K nonn,easy

%O 0,2

%A _N. J. A. Sloane_.

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .