The number of length 2n - 1 strings over the alphabet {0, 1} such that the first half of any initial odd length substring is a permutation of the second half.

A297789

The number of length 2n - 1 strings over the alphabet {0, 1} such that the first half of any initial odd length substring is a permutation of the second half.

Terms

    a(0) =1a(1) =2a(2) =3a(3) =4a(4) =7a(5) =11a(6) =17a(7) =25a(8) =49a(9) =75a(10) =129a(11) =191a(12) =329a(13) =489a(14) =825a(15) =1237a(16) =2473a(17) =3737a(18) =6329a(19) =9435a(20) =16833a(21) =25081a(22) =41449a(23) =61043a(24) =115409a(25) =172441a(26) =290617a(27) =431385a(28) =775641a(29) =1157417

External references