OFFSET
1,2
LINKS
Chai Wah Wu, Table of n, a(n) for n = 1..10000
EXAMPLE
3 = 11_2. Checking the multiples of 5 (which is 3*2-1) to determine the 3rd term of the sequence, we have: 1*5 = 5 = 101_2, which is a palindrome, but does not contain the substring '11'. 2*5 = 10 = 1010_2, which neither contains '11' nor is a palindrome. 3*5 = 15 = 1111_2, which is a palindrome and does contain the substring '11'. So a(3) = 15.
MAPLE
ispal := proc(L) local i; for i from 1 to nops(L)/2 do if op(i, L) <> op(-i, L) then RETURN(false) ; fi; od: RETURN(true) ; end: A158789 := proc(n) local k, adgs, a, ndgs; ndgs := convert(n, base, 2) ; for k from 1 do a := k*(2*n-1) ; adgs := convert(a, base, 2) ; if verify(ndgs, adgs, 'sublist') then if ispal(adgs) then RETURN(a) ; fi; fi; od: end: seq(A158789(n), n=1..55) ; # R. J. Mathar, Apr 16 2009
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Leroy Quet, Mar 26 2009
EXTENSIONS
More terms from R. J. Mathar, Apr 16 2009
STATUS
approved