|
Search: id:A090701
|
|
|
| A090701 |
|
a(n) is the minimal number k such that every binary word of length n can be divided into k palindromes. |
|
+0
2
|
|
| 1, 2, 2, 2, 2, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 6, 7, 7, 8, 8, 8, 8, 9, 9, 10, 10, 10, 10, 11
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
A word l_0...l_n is called a palindrome if l_i=l_{n-i} for all i<=n.
|
|
REFERENCES
|
A. Baababov, A "Pentium" is good but a mind is better, Kvant, v.4-5 (1999), P.38-42, (in Russian).
O. V. Ravsky, On the palindromic decomposition of binary words, Journal of Automata, Languages and Combinatorics, 8, #1 (2003), p. 71-74.
|
|
LINKS
|
A. Baababov, A "Pentium" is good but a mind is better
|
|
FORMULA
|
a(n)=[n/6]+[(n+4)/6]+1 for every number n<>11 and a(11)=5
|
|
CROSSREFS
|
Cf. A090702.
Sequence in context: A096605 A109497 A123919 this_sequence A056970 A008668 A116563
Adjacent sequences: A090698 A090699 A090700 this_sequence A090702 A090703 A090704
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Sasha Ravsky (oravsky(AT)mail.ru), Jan 12, 2004
|
|
|
Search completed in 0.002 seconds
|
