OFFSET
1,1
COMMENTS
A "minimum palindromic partition size" of a string is the fewest number of palindromes that the string can be partitioned into.
All terms are even because the letters of the alphabet can be swapped (e.g., "101100" can become "010011".)
EXAMPLE
The a(6) = 12 six-character strings that require A090701(6) = 3 partitions are:
100101 via (1001)(0)(1),
100110 via (1001)(1)(0),
101001 via (1)(0)(1001),
101100 via (101)(1)(00),
110010 via (1)(1001)(0),
110100 via (11)(010)(0),
along with the six strings made from swapping the 0's and 1's.
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Peter Kagey, Jan 19 2018
STATUS
approved