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 A067008 #19 Feb 14 2021 12:58:44
%S A067008 2,5,7,10,13,16,19,20,31,34,37,40,41,44,46,48,51,53,55,56,62,64,65,67,
%T A067008 68,69,73,74,76,79,81,82,83,84,85,86,87,89,95,96,97,99,100,101,106,
%U A067008 107,108,109,111,112,115,119,121,122,123,124,133,134,135,136,137,138,143
%N A067008 Numbers k such that Sum_{j=1..k} A008472(j) divides k!.
%H A067008 Giovanni Resta, <a href="/A067008/b067008.txt">Table of n, a(n) for n = 1..10000</a> (first 4114 terms from Daniel Starodubtsev)
%F A067008 a(n) seems to be asymptotic to c*n with c=2.3.....
%t A067008 tot[n_] := tot[n] = If[n < 2, 0, tot[n - 1] + Plus @@ FactorInteger[n][[;; , 1]]]; ef[n_, p_] := Block[{c=0, m=n}, While[m > 0, m = Floor[m/p]; c += m]; c]; ok[n_] := n > 1 && AllTrue[ FactorInteger@ tot@n, #[[1]] <= n && ef[n, #[[1]]] >= #[[2]] &]; Select[ Range@ 1000, ok] (* _Giovanni Resta_, Dec 13 2019 *)
%o A067008 (PARI) for (j=2,143,if(!(j!%sum(k=1,j,vecsum(factor(k)[,1]))),print1(j,", "))) \\ _Hugo Pfoertner_, Dec 13 2019
%Y A067008 Cf. A008472.
%K A067008 nonn
%O A067008 1,1
%A A067008 _Benoit Cloitre_, Oct 03 2002