%I #15 Jul 21 2019 08:57:47
%S 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,
%T 676,64,3068,304,18,1508,112,4,620,36,3350,214,14,1312
%N Number of lengthn binary strings achieving the maximum length of a minimal factorization (counted by A309077(n)).
%e For n = 8, there are exactly 4 strings having the minimal factorization of maximum weight, namely 01001101, 01101001 and their binary complements.
%Y Cf. A309077.
%K nonn,more
%O 1,1
%A _Jeffrey Shallit_, Jul 11 2019
%E a(21)a(40) from _Bert Dobbelaere_, Jul 21 2019
