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 A086577 #29 Sep 12 2024 18:49:48
%S A086577 0,54,594,5994,59994,599994,5999994,59999994,599999994,5999999994,
%T A086577 59999999994,599999999994,5999999999994,59999999999994,
%U A086577 599999999999994,5999999999999994,59999999999999994,599999999999999994,5999999999999999994,59999999999999999994,599999999999999999994
%N A086577 a(n) = 6*(10^n - 1).
%C A086577 Original definition: a(n) = k where R(k+6) = 6.
%H A086577 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (11,-10).
%F A086577 a(n) = 6*9*A002275(n) = 6*A002283(n).
%F A086577 R(a(n)) = A086576(n).
%F A086577 From _Chai Wah Wu_, Jul 08 2016: (Start)
%F A086577 a(n) = 11*a(n-1) - 10*a(n-2) for n > 1.
%F A086577 G.f.: 54*x/((1 - x)*(1 - 10*x)). (End)
%F A086577 E.g.f.: 6*exp(x)*(exp(9*x) - 1). - _Elmo R. Oliveira_, Sep 12 2024
%t A086577 LinearRecurrence[{11,-10},{0,54},30] (* _Harvey P. Dale_, Nov 27 2022 *)
%Y A086577 Cf. A002275, A004086 (R(n)).
%Y A086577 One of a family of sequences of the form "Numbers k such that reverse(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 A086577 nonn,base,easy
%O A086577 0,2
%A A086577 _Ray Chandler_, Jul 22 2003
%E A086577 Name edited by _Jinyuan Wang_, Aug 04 2021