%I #16 Aug 26 2017 20:09:44
%S 0,28,28,56,84,140,224,364,588,952,1540,2492,4032,6524,10556,17080,
%T 27636,44716,72352,117068,189420,306488,495908,802396,1298304,2100700,
%U 3399004,5499704,8898708,14398412
%N Fibonacci sequence beginning 0, 28.
%H G. C. Greubel, <a href="/A022362/b022362.txt">Table of n, a(n) for n = 0..1000</a>
%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 G.f.: 28*x/(1-x-x^2). - _Philippe Deléham_, Nov 20 2008
%F a(n) = 28*A000045(n). - _G. C. Greubel_, Aug 26 2017
%t a={};b=0;c=28;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 18 2008 *)
%t Table[28*Fibonacci[n], {n,0,50}] (* or *) LinearRecurrence[{1,1}, {0,28}, 50] (* _G. C. Greubel_, Aug 26 2017 *)
%o (PARI) for(n=0,50, print1(28*fibonacci(n), ", ")) \\ _G. C. Greubel_, Aug 26 2017
%K nonn
%O 0,2
%A _N. J. A. Sloane_
|