login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A162843
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
3, 9, 15, 21, 27, 45, 51, 63, 189, 93, 99, 495, 153, 189, 195, 219, 255, 1023, 297, 13803, 6307, 381, 387, 765, 495, 2457, 585, 1533, 693, 765, 771, 819, 891, 20345, 975, 1023, 20805, 4953, 1161, 2015, 69601, 25251, 1365, 157785, 19305, 1533, 1539, 2805
OFFSET
1,1
LINKS
Sean A. Irvine and Chai Wah Wu, Table of n, a(n) for n = 1..10000 (a(n) for n = 1..100 from Sean A. Irvine)
CROSSREFS
Cf. A162844.
Sequence in context: A016945 A222640 A110108 * A102954 A272749 A273560
KEYWORD
base,nonn
AUTHOR
Leroy Quet, Jul 14 2009
EXTENSIONS
More terms from Sean A. Irvine, Nov 22 2010
STATUS
approved