%I A022345
%S A022345 0,11,11,22,33,55,88,143,231,374,605,979,1584,2563,4147,
%T A022345 6710,10857,17567,28424,45991,74415,120406,194821,315227,
%U A022345 510048,825275,1335323,2160598,3495921,5656519,9152440
%N A022345 Fibonacci sequence beginning 0 11.
%D A022345 A. T. Benjamin and J. J. Quinn, Proofs that really count: the art of 
               combinatorial proof, M.A.A. 2003, p. 15.
%H A022345 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/
               RecursiveSequences.html">Recursive Sequences</a>
%F A022345 a(n) = 11F(n) = F(n+4) + F(n+2) + F(n) + F(n-2) + F(n-4), n>3.
%F A022345 G.f.: 11*x/(1-x-x^2). [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), 
               Nov 20 2008]
%t A022345 a={};b=0;c=11;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 A022345 Sequence in context: A040111 A003887 A138844 this_sequence A152082 A070849 
               A124297
%Y A022345 Adjacent sequences: A022342 A022343 A022344 this_sequence A022346 A022347 
               A022348
%K A022345 nonn
%O A022345 0,2
%A A022345 N. J. A. Sloane (njas(AT)research.att.com).