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 A034884 #38 May 08 2023 23:32:46 %S A034884 2,3,4,6,8,10,12,14,15,16,18,20,24,28,30,32,36,40,42,48,54,56,60,72, %T A034884 80,84,90,96,108,120,126,132,140,144,168,180,192,210,216,240,252,288, %U A034884 300,336,360,420,480,504,540,720,840,1260 %N A034884 Numbers k such that k < d(k)^2, where d(k) = A000005(k). %C A034884 See comment in A175495. - _Vladimir Shevelev_, May 07 2013 %C A034884 The deficient terms are 2, 3, 4, 8, 10, 14, 15, 16, 32; the first perfect or abundant number not listed is 66 = 2 * 3 * 11; the only term not 7-smooth is 132 = 2^2 * 3 * 11; the largest not divisible by 6 is 140 = 2^2 * 5 * 7. - _Peter Munn_, Sep 19 2021 %C A034884 The union of this sequence and A276734 has 74 total terms which are all k with floor(sqrt(k)) <= d(k). - _Bill McEachen_, Apr 07 2023 %t A034884 Select[Range[1300],#<DivisorSigma[0,#]^2&] (* _Harvey P. Dale_, Apr 11 2014 *) %o A034884 (PARI) isok(n) = (n < numdiv(n)^2) \\ _Michel Marcus_, Jun 07 2013 %Y A034884 Cf. A000005, A035033, A035034, A035035, A033950, A036763, A175495, A276734. %K A034884 nonn,fini,full %O A034884 1,1 %A A034884 _Erich Friedman_ %E A034884 _Labos Elemer_ added the last three terms and observes that this sequence is now complete.