|
%I #14 Jul 11 2024 13:15:35
%S 2,4,6,8,505,222,161,232,171,22,44,66,88,5005,858,616,616,1881,202,
%T 222,242,262,282,1661,1771,1881,1991,19291,404,424,444,464,484,2772,
%U 2882,2992,27072,29492,606,626,646,666,686,3883,3993,37673,38683,14541,808
%N Smallest palindromic multiple of n-th palindrome which is not a concatenation of copies of that palindrome.
%C Conjecture: (1). The sequence differs from A083145 only for finitely many values of n. (2) Values of n are 5,6,7,8 and 9.
%C Conjecture: The sequence differs from A083145 for infinitely many values of n. - _Franklin T. Adams-Watters_, May 16 2006
%H Chai Wah Wu, <a href="/A083146/b083146.txt">Table of n, a(n) for n = 1..10000</a>
%o (Python)
%o from itertools import count
%o def A083146(n):
%o 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)
%o for i in count(n+2):
%o 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 and (s:=str(q)) != (t:=str(p))*(len(s)//len(t)):
%o return q # _Chai Wah Wu_, Jul 11 2024
%Y Cf. A083145.
%Y Cf. A119368.
%K base,nonn
%O 1,1
%A _Amarnath Murthy_ and Meenakshi Srikanth (menakan_s(AT)yahoo.com), Apr 25 2003
%E More terms from _Franklin T. Adams-Watters_, May 16 2006
|
