login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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

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

EXAMPLE

For n = 8, there are exactly 4 strings having the minimal factorization of maximum weight, namely 01001101, 01101001 and their binary complements.

CROSSREFS

Cf. A309077.

Sequence in context: A246707 A324339 A211391 * A241543 A210740 A209820

Adjacent sequences:  A309075 A309076 A309077 * A309079 A309080 A309081

KEYWORD

nonn,more

AUTHOR

Jeffrey Shallit, Jul 11 2019

EXTENSIONS

a(21)-a(40) from Bert Dobbelaere, Jul 21 2019

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 October 14 12:02 EDT 2019. Contains 328004 sequences. (Running on oeis4.)