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 A015513 #13 May 04 2023 08:57:21
%S A015513 1,1,13,1742,2552030,41102995180,7281683317103260,
%T A015513 14189947350338830620680,304174136317707285574697584520,
%U A015513 71722670512982436329410134761448960400,186030135925835196854820049614502274473787544400
%N A015513 a(1) = 1, a(n) = Sum_{k=1..n-1} ((11^k - 1)/10)*a(k).
%H A015513 G. C. Greubel, <a href="/A015513/b015513.txt">Table of n, a(n) for n = 1..45</a>
%F A015513 a(n) = ((11^(n-1) + 9)/10) * a(n-1). - _Vincenzo Librandi_, Nov 12 2012
%t A015513 a[n_, m_]:= a[n, m]= If[n<3, 1, (m^(n-1) +m-2)*a[n-1,m]/(m-1)];
%t A015513 Table[a[n, 10], {n, 30}] (* _G. C. Greubel_, May 03 2023 *)
%o A015513 (Magma) [n le 2 select 1 else ((11^(n-1) + 9)/10) * Self(n-1): n in [1..15]]; // _Vincenzo Librandi_, Nov 12 2012
%o A015513 (SageMath)
%o A015513 def a(n, m) -> int: # a = A015513
%o A015513 return 1 if (n<3) else (m^(n-1)+m-2)*a(n-1, m)//(m-1)
%o A015513 [a(n, 11) for n in range(1,31)] # _G. C. Greubel_, May 03 2023
%Y A015513 Sequences with the recurrence a(n) = (m^(n-1) + m-2)*a(n-1)/(m-1): A036442 (m=2), A015502 (m=3), A015503 (m=4), A015506 (m=5), A015507 (m=6), A015508 (m=7), A015509 (m=8), A015511 (m=9), A015512 (m=10), this sequence (m=11), A015515 (m=12).
%K A015513 nonn,easy
%O A015513 1,3
%A A015513 _Olivier Gérard_