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 A157681 #24 Sep 08 2022 08:45:42
%S A157681 29,31,60,91,151,242,393,635,1028,1663,2691,4354,7045,11399,18444,
%T A157681 29843,48287,78130,126417,204547,330964,535511,866475,1401986,2268461,
%U A157681 3670447,5938908,9609355,15548263,25157618,40705881,65863499,106569380
%N A157681 Fibonacci sequence beginning 29, 31.
%H A157681 Harvey P. Dale, <a href="/A157681/b157681.txt">Table of n, a(n) for n = 1..1000</a>
%H A157681 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (1, 1).
%F A157681 a(n) = a(n-1) + a(n-2), a(0)=29, a(1)=31.
%F A157681 From _G. C. Greubel_, Nov 17 2018: (Start)
%F A157681 a(n) = 27*Fibonacci(n) + 2*Fibonacci(n+1).
%F A157681 G.f.: x*(29+2*x)/(1-x-x^2). (End)
%t A157681 LinearRecurrence[{1,1},{29,31},40] (* _Harvey P. Dale_, Dec 05 2014 *)
%t A157681 Table[27*Fibonacci[n] +2*Fibonacci[n+1], {n, 1, 40}] (* _G. C. Greubel_, Nov 17 2018 *)
%o A157681 (PARI) vector(40, n, 27*fibonacci(n) + 2*fibonacci(n+1)) \\ _G. C. Greubel_, Nov 17 2018
%o A157681 (Magma) [27*Fibonacci(n) + 2*Fibonacci(n+1): n in [1..40]]; // _G. C. Greubel_, Nov 17 2018
%o A157681 (Sage) [27*fibonacci(n)+2*fibonacci(n+1) for n in (1..10)] # _G. C. Greubel_, Nov 17 2018
%o A157681 (GAP) List([1..40], n -> 27*Fibonacci(n)+2*Fibonacci(n+1)); # _G. C. Greubel_, Nov 17 2018
%K A157681 nonn,easy
%O A157681 1,1
%A A157681 _Kyle D. Balliet_, Mar 04 2009