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 A287883 #17 May 09 2021 07:55:53
%S A287883 1,3,6,28,33,56,63,285,318,343,354,577,590,617,652,2874,2891,3124,
%T A287883 3143,3368,3405,3616,3639,5862,5917,6130,6463,6690,6719,6954,6985,
%U A287883 29207,29518,29735,29792,32025,32062,32281,32594,34819,34860,35097,35140,37351,37686,37909,37956,60179,60256,60511
%N A287883 Partial sums of A037276.
%H A287883 N. J. A. Sloane, <a href="/A287883/b287883.txt">Table of n, a(n) for n = 1..20000</a>
%t A287883 co[n_, k_] := Nest[Flatten[IntegerDigits[{#, n}]] &, n, k - 1]; A037276 =
%t A287883 Table[FromDigits[Flatten[IntegerDigits[co @@@ FactorInteger[n]]]], {n, 50}]; Table[Sum[A037276[[k]], {k, 1, n}], {n, 1, 25}] (* _G. C. Greubel_, Jun 23 2017 *)
%o A287883 (Python)
%o A287883 from sympy import factorint
%o A287883 def a037276(n):
%o A287883 f=factorint(n)
%o A287883 l=sorted([i for i in f])
%o A287883 return 1 if n==1 else int("".join(str(i)*f[i] for i in l))
%o A287883 l=[0, 1]
%o A287883 for n in range(2, 101): l.append(l[n - 1] + a037276(n))
%o A287883 print(l[1:]) # _Indranil Ghosh_, Jun 23 2017
%Y A287883 Cf. A037276.
%K A287883 nonn,base
%O A287883 1,2
%A A287883 _N. J. A. Sloane_, Jun 20 2017