The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A298477 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing all changes.

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).
(history; published version)

#10 by Wesley Ivan Hurt at Mon Apr 06 19:14:13 EDT 2020

STATUS

editing

approved

#9 by Wesley Ivan Hurt at Mon Apr 06 19:14:07 EDT 2020

EXAMPLE

along with the six strings made from swapping the 0s 0's and 1s1's.

STATUS

approved

editing

#8 by N. J. A. Sloane at Sun Jan 28 19:25:10 EST 2018

STATUS

proposed

approved

#7 by Jon E. Schoenfield at Sat Jan 20 16:33:14 EST 2018

STATUS

editing

proposed

#6 by Jon E. Schoenfield at Sat Jan 20 16:33:11 EST 2018

NAME

a(n) is the number of length n strings over a two -letter alphabet that have a minimum palindromic partition size of A090701(n).

COMMENTS

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:

STATUS

proposed

editing

#5 by Peter Kagey at Fri Jan 19 19:27:48 EST 2018

STATUS

editing

proposed

#4 by Peter Kagey at Fri Jan 19 18:49:41 EST 2018

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 0s and 1s.

#3 by Peter Kagey at Fri Jan 19 18:39:45 EST 2018

NAME

a(n) is the number of length n strings over a two letter alphabet that can be divided into have a minimum palindromic partition size of A090701(n) palindromes.

COMMENTS

All terms are evenA "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".)

#2 by Peter Kagey at Fri Jan 19 16:59:01 EST 2018

NAME

allocated for Peter Kageya(n) is the number of length n strings that can be divided into a minimum of A090701(n) palindromes.

DATA

2, 2, 4, 12, 24, 12, 28, 4, 16, 60, 4, 24, 140, 2, 32, 230, 1112, 36, 332, 4

OFFSET

1,1

COMMENTS

All terms are even.

CROSSREFS

Cf. A090701.

KEYWORD

allocated

nonn,more

AUTHOR

Peter Kagey, Jan 19 2018

STATUS

approved

editing

#1 by Peter Kagey at Fri Jan 19 16:30:04 EST 2018

NAME

allocated for Peter Kagey

KEYWORD

allocated

STATUS

approved