Greatest number such that the number of contiguous palindromic bit patterns in its binary representation is n, or 0, if there is no such number.

A217100

Greatest number such that the number of contiguous palindromic bit patterns in its binary representation is n, or 0, if there is no such number.

Terms

    a(0) =1a(1) =2a(2) =3a(3) =6a(4) =0a(5) =13a(6) =14a(7) =26a(8) =29a(9) =52a(10) =58a(11) =105a(12) =116a(13) =211a(14) =233a(15) =422a(16) =467a(17) =845a(18) =934a(19) =1690a(20) =1869a(21) =3380a(22) =3738a(23) =6761a(24) =7476a(25) =13523a(26) =14953a(27) =27046a(28) =29907a(29) =54093

External references