OFFSET
1,1
COMMENTS
a(n) must have more 1-bits than a(n)^3 when they are written in binary.
LINKS
Chris K. Caldwell and G. L. Honaker, Jr., 445317119867, Prime Curios!
K. G. Hare, S. Laishram, and T. Stoll, Stolarsky's conjecture and the sum of digits of polynomial values, arXiv:1001.4169 [math.NT], 2010. See p. 3.
Thomas Stoll, On Stolarsky's conjecture: The sum of digits of n and n^h, Slides, 2010.
EXAMPLE
PROG
(PARI) isok(k) = hammingweight(k) > hammingweight(k^3); \\ Michel Marcus, Aug 07 2023
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Zhao Hui Du, Jun 23 2023
EXTENSIONS
a(9)-a(18) from Martin Ehrenstein, Jul 31 2023
STATUS
approved