a(n) is the minimal number k such that every binary word of length n can be transformed into a palindrome or an antipalindrome by deleting at most k letters.
A090702
a(n) is the minimal number k such that every binary word of length n can be transformed into a palindrome or an antipalindrome by deleting at most k letters.
Terms
- a(0) =0a(1) =0a(2) =1a(3) =1a(4) =1a(5) =2a(6) =2a(7) =2a(8) =3a(9) =4a(10) =4a(11) =4a(12) =5a(13) =5a(14) =5a(15) =6a(16) =7a(17) =7a(18) =7a(19) =8a(20) =8a(21) =8a(22) =9a(23) =10a(24) =10a(25) =10a(26) =11a(27) =11a(28) =11a(29) =12
External references
- oeis: A090702