|
%I #29 Feb 18 2024 02:01:51
%S 1,28,29,57,86,143,229,372,601,973,1574,2547,4121,6668,10789,17457,
%T 28246,45703,73949,119652,193601,313253,506854,820107,1326961,2147068,
%U 3474029,5621097,9095126,14716223,23811349,38527572,62338921,100866493,163205414,264071907,427277321
%N Fibonacci sequence beginning 1, 28.
%H G. C. Greubel, <a href="/A022398/b022398.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.: (1+27*x)/(1-x-x^2). - _Philippe Deléham_, Nov 20 2008
%F a(n) = (2^(-1-n)*((1-sqrt(5))^n*(-55+sqrt(5)) + (1+sqrt(5))^n*(55+sqrt(5)))) / sqrt(5). - _Colin Barker_, Mar 02 2018
%t Table[Fibonacci[n + 2] + 26*Fibonacci[n], {n, 0, 50}] (* _G. C. Greubel_, Mar 01 2018 *)
%o (PARI) for(n=0, 40, print1(fibonacci(n+2) + 26*fibonacci(n), ", ")) \\ _G. C. Greubel_, Mar 01 2018
%o (Magma) [Fibonacci(n+2) + 26*Fibonacci(n): n in [0..40]]; // _G. C. Greubel_, Mar 01 2018
%K nonn
%O 0,2
%A _N. J. A. Sloane_
%E Terms a(30) onward added by _G. C. Greubel_, Mar 01 2018
|
