login
A392007
Smallest number k such that log_b(k) - floor(log_b(k)) >= 1/2 for b = 2..n, and not for b = n+1.
1
3, 6, 47, 56, 920483, 46341, 888667668, 13207922282067
OFFSET
2,1
COMMENTS
Probably infinite.
All the terms are of the form b^(y/2), where b is any of 2..n and where y is any odd number greater than 1. (See the link for proof.)
It is suspected that terms of the form (n+1)^z could exist, where z is any integer greater than 0.
EXAMPLE
a(4) = 47, because 47 is the smallest number k for which the inequality log_b(47) - ceiling(log_b(47)) >= 1/2 holds for b = 2,3,4 and not for b=5.
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Jakub Buczak, Dec 26 2025
STATUS
approved