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 A086579 #20 Mar 22 2025 17:51:25
%S A086579 0,72,792,7992,79992,799992,7999992,79999992,799999992,7999999992,
%T A086579 79999999992,799999999992,7999999999992,79999999999992,
%U A086579 799999999999992,7999999999999992,79999999999999992,799999999999999992,7999999999999999992,79999999999999999992,799999999999999999992
%N A086579 a(n) = 8*(10^n - 1).
%C A086579 Original definition: a(n) = k where R(k+8) = 8.
%H A086579 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (11,-10).
%F A086579 a(n) = 8*9*A002275(n) = 8*A002283(n).
%F A086579 R(a(n)) = A086574(n).
%F A086579 From _Chai Wah Wu_, Jul 08 2016: (Start)
%F A086579 a(n) = 11*a(n-1) - 10*a(n-2) for n > 1.
%F A086579 G.f.: 72*x/((1 - x)*(1 - 10*x)). (End)
%F A086579 E.g.f.: 8*exp(x)*(exp(9*x) - 1). - _Elmo R. Oliveira_, Sep 12 2024
%t A086579 LinearRecurrence[{11,-10},{0,72},30] (* _Harvey P. Dale_, Mar 22 2025 *)
%Y A086579 Cf. A002275, A004086 (R(n)).
%Y A086579 One of family of sequences of form a(n) = k, where R(k+m) = m, m=1 to 9; m=1: A002283, m=2: A086573, m=3: A086574, m=4: A086575, m=5: A086576, m=6: A086577, m=7: A086578, m=8: A086579, m=9: A086580.
%K A086579 nonn,easy
%O A086579 0,2
%A A086579 _Ray Chandler_, Jul 22 2003
%E A086579 Edited by _Jinyuan Wang_, Aug 04 2021