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 A014837 #22 Apr 05 2022 03:08:13
%S A014837 2,3,7,9,15,16,20,24,34,33,45,51,59,57,73,72,90,91,103,113,135,127,
%T A014837 143,155,167,170,198,192,222,220,240,256,280,260,296,314,338,332,372,
%U A014837 366,408,415,429,451,497,471,507,514,546,555,607,597,637,633,669,697
%N A014837 Sum of all the digits of n in every base from 2 to n-1.
%H A014837 Vincenzo Librandi, <a href="/A014837/b014837.txt">Table of n, a(n) for n = 3..10000</a>
%F A014837 a(n) = A043306(n) - 1. - _Amiram Eldar_, Apr 16 2021
%t A014837 Table[Plus @@ Flatten[Table[IntegerDigits[n, b], {b, 2, n - 1}]], {n, 3, 36}] (* _Alonso del Arte_, Mar 28 2009 *)
%o A014837 (Python)
%o A014837 from sympy.ntheory.digits import digits
%o A014837 def a(n): return sum(sum(digits(n, b)[1:]) for b in range(2, n))
%o A014837 print([a(n) for n in range(3, 59)]) # _Michael S. Branicky_, Apr 04 2022
%Y A014837 Cf. A043306.
%K A014837 nonn,base
%O A014837 3,1
%A A014837 _Olivier Gérard_