%I A022091
%S A022091 0,8,8,16,24,40,64,104,168,272,440,712,1152,1864,3016,4880,
%T A022091 7896,12776,20672,33448,54120,87568,141688,229256,370944,
%U A022091 600200,971144,1571344,2542488,4113832,6656320,10770152
%N A022091 Fibonacci sequence beginning 0 8.
%D A022091 A. T. Benjamin and J. J. Quinn, Proofs that really count: the art of 
               combinatorial proof, M.A.A. 2003, p. 15.
%H A022091 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/
               RecursiveSequences.html">Recursive Sequences</a>
%F A022091 a(n) = round( (16phi-8)/5 phi^n) (works for n>4) - Thomas Baruchel, Sep 
               08 2004
%F A022091 a(n) = 8F(n) = F(n+4) + F(n) + F(n-4), n>3.
%F A022091 G.f.: 8*x/(1-x-x^2). [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), 
               Nov 20 2008]
%t A022091 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 [From Vladimir Orlovsky (4vladimir(AT)gmail.com), 
               Sep 17 2008]
%Y A022091 Sequence in context: A040057 A028997 A112439 this_sequence A145909 A135405 
               A006784
%Y A022091 Adjacent sequences: A022088 A022089 A022090 this_sequence A022092 A022093 
               A022094
%K A022091 nonn
%O A022091 0,2
%A A022091 N. J. A. Sloane (njas(AT)research.att.com).