The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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. 1
 0, 0, 1, 1, 1, 2, 2, 2, 3, 4, 4, 4, 5, 5, 5, 6, 7, 7, 7, 8 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,6 COMMENTS A word l_0...l_n is called a palindrome if l_i=l_{n-i} for all i<=n. A binary word l_0...l_n is called an antipalindrome if l_i<>l_{n-i} for all i<=n REFERENCES I. Protasov, Palindromial equivalence: one theorem and two problems, Matem. Studii, 14, #1, (2000), p. 111. O. V. Ravsky, A New Measure of Asymmetry of Binary Words, Journal of Automata, Languages and Combinatorics, 8, #1 (2003), p. 75-83. LINKS FORMULA a(n)>=[(n+2*[(n-3)/7])/3] for every n and for 2<=n<=20 equality holds. CROSSREFS Cf. A090701. Sequence in context: A055748 A284520 A342248 * A029124 A113512 A338624 Adjacent sequences:  A090699 A090700 A090701 * A090703 A090704 A090705 KEYWORD nonn,base AUTHOR Sasha Ravsky (oravsky(AT)mail.ru), Jan 12 2004 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 18 12:35 EDT 2021. Contains 347527 sequences. (Running on oeis4.)