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 A022353 #24 Jul 14 2025 10:03:47
%S A022353 0,19,19,38,57,95,152,247,399,646,1045,1691,2736,4427,7163,11590,
%T A022353 18753,30343,49096,79439,128535,207974,336509,544483,880992,1425475,
%U A022353 2306467,3731942,6038409,9770351,15808760,25579111,41387871,66966982,108354853,175321835,283676688
%N A022353 Fibonacci sequence beginning 0, 19.
%H A022353 G. C. Greubel, <a href="/A022353/b022353.txt">Table of n, a(n) for n = 0..1000</a>
%H A022353 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H A022353 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (1,1).
%F A022353 G.f.: 19*x/(1-x-x^2). - _Philippe Deléham_, Nov 20 2008
%F A022353 a(n) = 19*A000045(n). - _G. C. Greubel_, Aug 26 2017
%t A022353 a={};b=0;c=19;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 17 2008 *)
%t A022353 Table[19*Fibonacci[n], {n,0,50}] (* or *) LinearRecurrence[{1,1}, {0,19}, 50] (* _G. C. Greubel_, Aug 26 2017 *)
%o A022353 (PARI) a(n) = 19*fibonacci(n); \\ _G. C. Greubel_, Aug 26 2017
%K A022353 nonn,easy
%O A022353 0,2
%A A022353 _N. J. A. Sloane_