|
%I #26 Feb 18 2024 02:02:11
%S 1,32,33,65,98,163,261,424,685,1109,1794,2903,4697,7600,12297,19897,
%T 32194,52091,84285,136376,220661,357037,577698,934735,1512433,2447168,
%U 3959601,6406769,10366370,16773139,27139509,43912648,71052157,114964805,186016962,300981767,486998729
%N Fibonacci sequence beginning 1, 32.
%H G. C. Greubel, <a href="/A022402/b022402.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).
%t Table[Fibonacci[n + 2] + 30*Fibonacci[n], {n, 0, 50}] (* _G. C. Greubel_, Mar 01 2018 *)
%o (PARI) for(n=0, 40, print1(fibonacci(n+2) + 30*fibonacci(n), ", ")) \\ _G. C. Greubel_, Mar 01 2018
%o (Magma) [Fibonacci(n+2) + 30*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
|
