OFFSET
3,1
COMMENTS
The problem has no solution in base 2, so sequence begins with the base-3 solution. The idea was suggested by a NY Times article (Sunday Magazine of Mar 29, 2009) -- in which Freeman Dyson is said to have solved the base-10 question almost instantaneously when it was posed to him -- and by the ensuing math-fun discussion.
EXAMPLE
For n = 5, the smallest positive integer whose base-5 representation doubles when the rightmost digit is moved to become the leftmost digit is 8 = 13_5; 31_5 = 16.
For n = 8, the smallest positive integer whose base-8 representation doubles when the rightmost digit is moved to become the leftmost digit is 21 = 25_8; 52_8 = 42. - Robert Tanniru, Aug 09 2022
For n = 13, the number can't be represented in this list as it would be 27A5 in base 13.
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Daniel Asimov (asimov(AT)msri.org), Mar 28 2009
EXTENSIONS
a(5) corrected by William A. Hoffman III (whoff(AT)robill.com), Apr 19 2009
a(8) corrected by Robert Tanniru, Aug 09 2022
a(11)-a(12) from Robert Tanniru, Aug 11 2022, using A087502
STATUS
approved