Let S be the binary string consisting of the first n digits of (100101)*; a(n) = number of ways of writing S as a product of palindromes.

A215255

Let S be the binary string consisting of the first n digits of (100101)*; a(n) = number of ways of writing S as a product of palindromes.

Terms

    a(0) =1a(1) =1a(2) =2a(3) =3a(4) =4a(5) =6a(6) =10a(7) =13a(8) =23a(9) =29a(10) =42a(11) =65a(12) =107a(13) =136a(14) =243a(15) =308a(16) =444a(17) =687a(18) =1131a(19) =1439a(20) =2570a(21) =3257a(22) =4696a(23) =7266a(24) =11962a(25) =15219a(26) =27181a(27) =34447a(28) =49666a(29) =76847

External references