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 A367650 #8 Nov 28 2023 11:01:15
%S A367650 19134,130239,1241289,12351789,123456789,1234506789,12345006789,
%T A367650 123450006789,1234500006789,12345000006789,123450000006789,
%U A367650 1234500000006789,12345000000006789,123450000000006789,1234500000000006789,12345000000000006789,123450000000000006789,1234500000000000006789
%N A367650 a(n) = 12345*10^n + 6789.
%C A367650 For n > 3, a(n) satisfies (R(a(n)) - 1)/(a(n) + 1) = 8, where R(x) = A004086(x) is decimal digit reversal.
%H A367650 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (11,-10).
%F A367650 a(n) = 11*a(n-1) - 10*a(n-2) for n > 1.
%F A367650 O.g.f.: 9*(2126 - 8915*x)/((1 - x)*(1 - 10*x)).
%F A367650 E.g.f.: 3*exp(x)*(2263 + 4115*exp(9*x)).
%t A367650 LinearRecurrence[{11,-10},{19134,130239},20]
%Y A367650 Cf. A004086, A011557, A367593.
%K A367650 nonn,base,easy
%O A367650 0,1
%A A367650 _Stefano Spezia_, Nov 25 2023