Number of binary strings of length n having exactly one factorization as a concatenation of palindromes of length >= 2.
A241211
Number of binary strings of length n having exactly one factorization as a concatenation of palindromes of length >= 2.
Terms
- a(0) =0a(1) =2a(2) =4a(3) =4a(4) =18a(5) =22a(6) =64a(7) =96a(8) =188a(9) =388a(10) =648a(11) =1248a(12) =2040a(13) =3784a(14) =6544a(15) =11162a(16) =19356a(17) =32396a(18) =55768a(19) =93678a(20) =157308a(21) =263308a(22) =438512a(23) =731198a(24) =1211304a(25) =2004076a(26) =3306552a(27) =5445588a(28) =8955544a(29) =14690980
External references
- oeis: A241211