This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A022402 #28 Nov 16 2024 14:03:32
%S A022402 1,32,33,65,98,163,261,424,685,1109,1794,2903,4697,7600,12297,19897,
%T A022402 32194,52091,84285,136376,220661,357037,577698,934735,1512433,2447168,
%U A022402 3959601,6406769,10366370,16773139,27139509,43912648,71052157,114964805,186016962,300981767,486998729
%N A022402 Fibonacci sequence beginning 1, 32.
%H A022402 G. C. Greubel, <a href="/A022402/b022402.txt">Table of n, a(n) for n = 0..1000</a>
%H A022402 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H A022402 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (1, 1).
%t A022402 Table[Fibonacci[n + 2] + 30*Fibonacci[n], {n, 0, 50}] (* _G. C. Greubel_, Mar 01 2018 *)
%t A022402 LinearRecurrence[{1,1},{1,32},40] (* _Harvey P. Dale_, Nov 16 2024 *)
%o A022402 (PARI) for(n=0, 40, print1(fibonacci(n+2) + 30*fibonacci(n), ", ")) \\ _G. C. Greubel_, Mar 01 2018
%o A022402 (Magma) [Fibonacci(n+2) + 30*Fibonacci(n): n in [0..40]]; // _G. C. Greubel_, Mar 01 2018
%K A022402 nonn
%O A022402 0,2
%A A022402 _N. J. A. Sloane_
%E A022402 Terms a(30) onward added by _G. C. Greubel_, Mar 01 2018