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 A118672 #13 Apr 06 2021 02:57:55
%S A118672 2,4,6,8,9,10,12,14,16,18,20,22,24,26,27,28,30,32,34,36,38,40,42,44,
%T A118672 45,46,48,50,52,54,56,58,60,62,63,64,66,68,70,72,74,76,78,80,81,82,84,
%U A118672 86,88,90,92,94,96,98,99,100,102,104,106,108,110,112,114,116,117,118,120
%N A118672 Numbers divisible by prime(i)^i for some i.
%C A118672 Any multiple of an element of this sequence is in the sequence. The primitive elements of this sequence are A062457.
%C A118672 The asymptotic density of this sequence is 1 - Product_{k>=1} (1 - 1/prime(k)^k) = 0.55929756713969708790... - _Amiram Eldar_, Apr 06 2021
%H A118672 Robert Israel, <a href="/A118672/b118672.txt">Table of n, a(n) for n = 1..10000</a>
%p A118672 N:= 1000: # to get all terms <= N
%p A118672 S:= {}:
%p A118672 for i from 1 do
%p A118672 v:= ithprime(i)^i;
%p A118672 if v > N then break fi;
%p A118672 S:= S union {seq(j,j=v..N,v)};
%p A118672 od:
%p A118672 sort(convert(S,list)); # _Robert Israel_, Mar 27 2018
%t A118672 seq[max_] := Module[{s = {}, p = 2, i = 1, q = 2}, While[q < max, s = Join[s, Range[q, max, q]]; p = NextPrime[p]; i++; q = p^i]; Union[s]]; seq[120] (* _Amiram Eldar_, Apr 06 2021 *)
%Y A118672 Cf. A062457, A000040.
%Y A118672 Complement of A325128.
%K A118672 nonn
%O A118672 1,1
%A A118672 _Franklin T. Adams-Watters_, May 19 2006
%E A118672 An incorrect g.f. was deleted by _N. J. A. Sloane_, Sep 13 2009