login
Let b(n) be the n-th positive integer that is a palindrome in base 2. a(n) = the smallest multiple of b(n) that is > b(n) and that is also a palindrome in binary.
2

%I #19 Apr 03 2016 22:30:12

%S 3,9,15,21,27,45,51,63,189,93,99,495,153,189,195,219,255,1023,297,

%T 13803,6307,381,387,765,495,2457,585,1533,693,765,771,819,891,20345,

%U 975,1023,20805,4953,1161,2015,69601,25251,1365,157785,19305,1533,1539,2805

%N Let b(n) be the n-th positive integer that is a palindrome in base 2. a(n) = the smallest multiple of b(n) that is > b(n) and that is also a palindrome in binary.

%H Sean A. Irvine and Chai Wah Wu, <a href="/A162843/b162843.txt">Table of n, a(n) for n = 1..10000</a> (a(n) for n = 1..100 from Sean A. Irvine)

%Y Cf. A162844.

%K base,nonn

%O 1,1

%A _Leroy Quet_, Jul 14 2009

%E More terms from _Sean A. Irvine_, Nov 22 2010