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

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A298477 a(n) is the number of length n strings over a two-letter alphabet that have a minimum palindromic partition size of A090701(n). 0
2, 2, 4, 12, 24, 12, 28, 4, 16, 60, 4, 24, 140, 2, 32, 230, 1112, 36, 332, 4 (list; graph; refs; listen; history; text; internal format)
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".)

LINKS

Table of n, a(n) for n=1..20.

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

Cf. A090701.

Sequence in context: A134720 A019225 A002840 * A253677 A182894 A286410

Adjacent sequences:  A298474 A298475 A298476 * A298478 A298479 A298480

KEYWORD

nonn,more

AUTHOR

Peter Kagey, Jan 19 2018

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 9 08:41 EST 2021. Contains 349627 sequences. (Running on oeis4.)