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 A109052 #30 Sep 08 2023 07:33:09
%S A109052 0,11,22,33,44,55,66,77,88,99,110,11,132,143,154,165,176,187,198,209,
%T A109052 220,231,22,253,264,275,286,297,308,319,330,341,352,33,374,385,396,
%U A109052 407,418,429,440,451,462,473,44,495,506,517,528,539,550,561,572,583
%N A109052 a(n) = lcm(n,11).
%H A109052 Amiram Eldar, <a href="/A109052/b109052.txt">Table of n, a(n) for n = 0..10000</a>
%H A109052 <a href="/index/Rec#order_22">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,-1).
%H A109052 <a href="/index/Lc#lcm">Index entries for sequences related to lcm's</a>.
%F A109052 a(n) = n*11/gcd(n, 11).
%F A109052 G.f.: 11*x/(1-x)^2 - 110*x^11/(1-x^11)^2. - _Robert Israel_, May 28 2014
%F A109052 From _Amiram Eldar_, Nov 26 2022: (Start)
%F A109052 a(n) = 11*A106612(n) = 11*n/A109014(n).
%F A109052 Sum_{k=1..n} a(k) ~ (111/22) * n^2. (End)
%F A109052 Sum_{n>=1} (-1)^(n+1)/a(n) = 21*log(2)/121. - _Amiram Eldar_, Sep 08 2023
%p A109052 seq(ilcm(n,11),n=0..100); # _Robert Israel_, May 28 2014
%t A109052 LCM[#,11]&/@Range[0,60] (* _Harvey P. Dale_, Mar 13 2011 *)
%o A109052 (Sage) [lcm(n,11)for n in range(0, 54)] # _Zerinvary Lajos_, Jun 09 2009
%Y A109052 Cf. A106612, A109014, A109042.
%K A109052 nonn,easy
%O A109052 0,2
%A A109052 _Mitch Harris_, Jun 18 2005