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 A086576 #36 Sep 12 2024 17:24:06 %S A086576 0,45,495,4995,49995,499995,4999995,49999995,499999995,4999999995, %T A086576 49999999995,499999999995,4999999999995,49999999999995, %U A086576 499999999999995,4999999999999995,49999999999999995,499999999999999995,4999999999999999995,49999999999999999995,499999999999999999995 %N A086576 a(n) = 5*(10^n - 1). %C A086576 Original definition: a(n) = k where R(k+5) = 5. %H A086576 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (11,-10). %F A086576 a(n) = 5*9*A002275(n) = 5*A002283(n). %F A086576 R(a(n)) = A086577(n). %F A086576 From _Chai Wah Wu_, Jul 08 2016: (Start) %F A086576 a(n) = 11*a(n-1) - 10*a(n-2) for n > 1. %F A086576 G.f.: 45*x/((1 - x)*(1 - 10*x)). (End) %F A086576 E.g.f.: 5*exp(x)*(exp(9*x) - 1). - _Elmo R. Oliveira_, Sep 12 2024 %e A086576 From _John Elias_, Jun 23 2021: (Start) %e A086576 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 = 45; %e A086576 11 + 22 + 33 + 44 + 55 + 66 + 77 + 88 + 99 = 495; %e A086576 111 + 222 + 333 + 444 + 555 + 666 + 777 + 888 + 999 = 4995; %e A086576 1111 + 2222 + 3333 + 4444 + 5555 + 6666 + 7777 + 8888 + 9999 = 49995; %e A086576 11111 + 22222 + 33333 + 44444 + 55555 + 66666 + 77777 + 88888 + 99999 = 499995; etc. (End) %t A086576 Join[{0}, LinearRecurrence[{11,-10},{45,495},50]] (* _G. C. Greubel_, Jul 08 2016 *) %Y A086576 Cf. A002275, A004086 (R(n)). %Y A086576 Cf. 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 A086576 nonn,base,easy %O A086576 0,2 %A A086576 _Ray Chandler_, Jul 22 2003 %E A086576 Name edited by _Jinyuan Wang_, Aug 04 2021