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 A363799 #31 Aug 07 2023 12:28:30 %S A363799 407182835067,445317119867,478351981947,814365670134,873268508637, %T A363799 890634239734,956703963894,956703964539,1628731340268,1746537017274, %U A363799 1781268479468,1913407927788,1913407929078,2774213097787,3257462680536,3493074034548,3562536958936,3573277243773 %N A363799 Numbers whose binary representation has more 1-bits than its cube. %C A363799 a(n) must have more 1-bits than a(n)^3 when they are written in binary. %H A363799 Chris K. Caldwell and G. L. Honaker, Jr., <a href="https://primes.utm.edu/curios/page.php?short=445317119867">445317119867</a>, Prime Curios! %H A363799 K. G. Hare, S. Laishram, and T. Stoll, <a href="https://arxiv.org/abs/1001.4169">Stolarsky's conjecture and the sum of digits of polynomial values</a>, arXiv:1001.4169 [math.NT], 2010. See p. 3. %H A363799 Thomas Stoll, <a href="https://www.irif.fr/~steiner/stoll_aussois.pdf">On Stolarsky's conjecture: The sum of digits of n and n^h</a>, Slides, 2010. %e A363799 407182835067 is a term because A000120(407182835067) = 29, while A192085(407182835067) = A000120(407182835067^3) = 28. %o A363799 (PARI) isok(k) = hammingweight(k) > hammingweight(k^3); \\ _Michel Marcus_, Aug 07 2023 %Y A363799 Cf. A000120, A192085, A138597 (equality). %Y A363799 Cf. A094694 (for squares). %K A363799 nonn,base %O A363799 1,1 %A A363799 _Zhao Hui Du_, Jun 23 2023 %E A363799 a(9)-a(18) from _Martin Ehrenstein_, Jul 31 2023