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 A056761 #26 Jun 20 2021 07:35:39 %S A056761 3,5,7,9,15,21,25,27,33,35,39,45,51,55,57,63,75,81,99,105,117,135,147, %T A056761 153,165,171,175,189,195,207,225,231,255,273,285,297,315,345,351,357, %U A056761 375,385,399,405,429,435,441,455,459,465,483,495,525,567,585,675,693 %N A056761 Odd numbers less than the cube of their number of divisors. %C A056761 Last term is a(267) = 883575, confirming the author's conjecture. - _Charles R Greathouse IV_, Apr 27 2011 %H A056761 Zak Seidov, <a href="/A056761/b056761.txt">Table of n, a(n) for n = 1..267</a> (complete sequence) %e A056761 14175 = 81*25*7 has 30 divisors, and 30^3 = 27000 > 14175. %t A056761 Select[Range[1, 10^6 + 1, 2], DivisorSigma[0, #]^3 > # &] (* _Michael De Vlieger_, Oct 26 2017 *) %o A056761 (PARI) isok(n) = (n % 2) && (numdiv(n)^3 > n); \\ _Michel Marcus_, Dec 19 2013 %Y A056761 Cf. A035033-A035035, A034884, A000005, A000265, A056757-A056767, A056781. %K A056761 fini,full,nonn %O A056761 1,1 %A A056761 _Labos Elemer_, Aug 16 2000