reviewed
approved
reviewed
approved
proposed
reviewed
editing
proposed
.... if l > 0:
........ yield 0
........ for x in range(1, l+1):
............ for y in range(b**(x-1), b**x):
................ s = digits(y, b)
................ yield int(s+s[-2::-1])
............ for y in range(b**(x-1), b**x):
................ s = digits(y, b)
................ yield int(s+s[::-1])
proposed
editing
editing
proposed
(* get NextPalindrome from A029965 *) Select[NestList[NextPalindrome, 0, 62], Max@IntegerDigits@# < 9 &] (* Robert G. Wilson v , May 09 2006 *)
proposed
editing
editing
proposed
return int((s:=digits(n-x, 9))+s[-2::-1] if n<x+y else (s:=digits(n-y, 9))+s[::-1]) # Chai Wah Wu, Jun 14 2024
(Python)
from sympy import integer_log
from gmpy2 import digits
def A118600(n):
if n == 1: return 0
y = 9*(x:=9**integer_log(n>>1, 9)[0])
return int((s:=digits(n-x, 9))+s[-2::-1] if n<x+y else (s:=digits(n-y, 9))+s[::-1]) # Chai Wah Wu, Jun 14 2024
approved
editing
proposed
approved