OFFSET
1,1
LINKS
Chai Wah Wu, Table of n, a(n) for n = 1..10000 (terms 1..1000 from Harvey P. Dale)
MATHEMATICA
spm[n_]:=Module[{k=2}, While[!PalindromeQ[n k], k++]; n k]; spm/@Select[ Range[ 500], PalindromeQ] (* Harvey P. Dale, Aug 01 2021 *)
PROG
(Python)
from itertools import count
def A083145(n):
p = (c:=n+1-x)*x+int(str(c)[-2::-1] or 0) if n+1<(x:=10**(len(str(n+1>>1))-1))+(y:=10*x) else (c:=n+1-y)*y+int(str(c)[::-1] or 0)
for i in count(n+2):
if not (q:=(c:=i-x)*x+int(str(c)[-2::-1] or 0) if i<(x:=10**(len(str(i>>1))-1))+(y:=10*x) else (c:=i-y)*y+int(str(c)[::-1] or 0))%p:
return q # Chai Wah Wu, Jul 11 2024
CROSSREFS
KEYWORD
base,nonn
AUTHOR
Amarnath Murthy and Meenakshi Srikanth (menakan_s(AT)yahoo.com), Apr 25 2003
EXTENSIONS
More terms from Franklin T. Adams-Watters, May 16 2006
Definition clarified by Harvey P. Dale, Aug 01 2021
STATUS
approved