OFFSET
1,1
COMMENTS
The corresponding b's are: 2, 2, 3, 3, 3, 5, 5, 5, 7, 9, 9, 9, 9, 9, 11, ...
From Sean A. Irvine, Aug 18 2025: (Start)
Numbers k such that k = Sum_{j>=1} d(j) * b^j = Sum_{j>=0} d(j+1) * (b+1)^j where 0 <= d(j) < b.
For k to be a solution in base b, we require Sum d(j) = 0 (mod b) and Sum_{j>=2} (-1)^j*d(j) = 2*d(1) (mod b+1). (End)
LINKS
Sean A. Irvine, Python program
EXAMPLE
a(1) = 10, is 1010 in base 2 and 101 in base 3.
a(2) = 12, is 1100 in base 2 and 110 in base 3.
a(3) = 273, is 101010 in base 3 and 10101 in base 4.
PROG
(PARI) isok(k) = for (b=2, k-1, if (digits(k, b) == concat(digits(k, b+1), 0), return(b)); ); \\ Michel Marcus, Aug 16 2025
CROSSREFS
KEYWORD
nonn,base,more
AUTHOR
Cristiano Campos de Oliveira, Aug 15 2025
EXTENSIONS
a(9)-a(15) from Sean A. Irvine, Aug 18 2025
STATUS
approved
