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 A007951 #22 Mar 21 2021 12:09:57
%S A007951 1,2,4,5,7,8,10,11,14,16,17,19,20,22,23,25,28,29,31,32,34,35,37,38,41,
%T A007951 43,46,47,49,50,52,55,56,58,59,61,62,64,65,68,70,71,73,74,76,77,79,82,
%U A007951 83,85,86,88,91,92,95,97,98,100,101,103,104,106,109,110,112,113,115,116,118
%N A007951 Ternary sieve: delete every 3rd number, then every 9th, 27th, etc.
%C A007951 Smarandache calls this a "trinary" sieve. - _N. J. A. Sloane_, Jan 03 2020
%C A007951 The asymptotic density of this sequence is Product_{k>=1} (1 - 1/3^k) = 0.560126... (A100220). - _Amiram Eldar_, Mar 21 2021
%H A007951 Rémy Sigrist, <a href="/A007951/b007951.txt">Table of n, a(n) for n = 1..25000</a>
%H A007951 Florentin Smarandache, <a href="http://www.gallup.unm.edu/~smarandache/OPNS.pdf">Only Problems, Not Solutions!</a>, 4th ed., 1993; Problem 96.
%H A007951 <a href="/index/Si#sieve">Index entries for sequences generated by sieves</a>
%o A007951 (PARI) v = List([1..118]); t=3; while (#v>=t, forstep (k=#v\t, 1, -1, listpop(v, k*t);); t*=3;); print (v) \\ _Rémy Sigrist_, Jan 05 2020
%Y A007951 Cf. A007950, A092418, A100220.
%K A007951 nonn
%O A007951 1,2
%A A007951 R. Muller