|
|
A309078
|
|
Number of length-n binary strings achieving the maximum length of a minimal factorization (counted by A309077(n)).
|
|
2
|
|
|
2, 2, 2, 6, 4, 16, 10, 4, 34, 12, 4, 36, 8, 150, 22, 4, 132, 18, 2, 74, 4, 324, 30, 2, 162, 4, 676, 64, 3068, 304, 18, 1508, 112, 4, 620, 36, 3350, 214, 14, 1312
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
EXAMPLE
|
For n = 8, there are exactly 4 strings having the minimal factorization of maximum weight, namely 01001101, 01101001 and their binary complements.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|