Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #26 Feb 18 2024 02:01:40
%S 1,25,26,51,77,128,205,333,538,871,1409,2280,3689,5969,9658,15627,
%T 25285,40912,66197,107109,173306,280415,453721,734136,1187857,1921993,
%U 3109850,5031843,8141693,13173536,21315229,34488765,55803994,90292759,146096753,236389512,382486265,618875777
%N Fibonacci sequence beginning 1, 25.
%H G. C. Greubel, <a href="/A022395/b022395.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+24*x)/(1-x-x^2). - _Philippe Deléham_, Nov 20 2008
%t Table[Fibonacci[n+2] + 23*Fibonacci[n], {n, 0, 50}] (* _G. C. Greubel_, Mar 01 2018 *)
%o (PARI) for(n=0, 40, print1(fibonacci(n+2) + 23*fibonacci(n), ", ")) \\ _G. C. Greubel_, Mar 01 2018
%o (Magma) [Fibonacci(n+2) + 23*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