|
%I #16 Aug 26 2017 20:09:56
%S 0,26,26,52,78,130,208,338,546,884,1430,2314,3744,6058,9802,15860,
%T 25662,41522,67184,108706,175890,284596,460486,745082,1205568,1950650,
%U 3156218,5106868,8263086,13369954
%N Fibonacci sequence beginning 0, 26.
%H G. C. Greubel, <a href="/A022360/b022360.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.: 26*x/(1-x-x^2). - _Philippe Deléham_, Nov 20 2008
%F a(n) = 26*A000045(n). - _G. C. Greubel_, Aug 26 2017
%t a={};b=0;c=26;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[26*Fibonacci[n], {n,0,50}] (* or *) LinearRecurrence[{1,1}, {0,26}, 50] (* _G. C. Greubel_, Aug 26 2017 *)
%o (PARI) for(n=0,50, print1(26*fibonacci(n), ", ")) \\ _G. C. Greubel_, Aug 26 2017
%K nonn
%O 0,2
%A _N. J. A. Sloane_
|
