|
%I #25 Jan 19 2018 21:13:10
%S 0,8,8,16,24,40,64,104,168,272,440,712,1152,1864,3016,4880,7896,12776,
%T 20672,33448,54120,87568,141688,229256,370944,600200,971144,1571344,
%U 2542488,4113832,6656320,10770152,17426472,28196624,45623096,73819720,119442816
%N Fibonacci sequence beginning 0, 8.
%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>
%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (1, 1).
%F a(n) = round( (16phi-8)/5 phi^n) (works for n>4). - _Thomas Baruchel_, Sep 08 2004
%F a(n) = 8*F(n) = F(n+4) + F(n) + F(n-4) for n>3, where F=A000045.
%F G.f.: 8*x/(1-x-x^2). - _Philippe Deléham_, Nov 20 2008
%t a={};b=0;c=8;AppendTo[a, b];AppendTo[a, c];Do[b=b+c;AppendTo[a, b];c=b+c;AppendTo[a, c], {n, 4!}];a (* _Vladimir Joseph Stephan Orlovsky_, Sep 17 2008 *)
%t LinearRecurrence[{1,1},{0,8},40] (* _Harvey P. Dale_, Jan 19 2018 *)
%Y Cf. A000032, A000045, A258160.
%K nonn,easy
%O 0,2
%A _N. J. A. Sloane_.
|
