OFFSET
1,1
COMMENTS
Column 1 of A222959
Conjecture: A binary word is counted iff it has the same sum of positions of 1's as its reverse, or, equivalently, the same sum of partial sums as its reverse. - Gus Wiseman, Jan 07 2023
LINKS
R. H. Hardin, Table of n, a(n) for n = 1..210
EXAMPLE
All solutions for n=4
..0....1....1....0
..0....1....0....1
..0....1....0....1
..0....1....1....0
From Gus Wiseman, Jan 07 2023: (Start)
The a(1) = 2 through a(7) = 20 binary words with least squares fit a line of zero slope are:
(0) (00) (000) (0000) (00000) (000000) (0000000)
(1) (11) (010) (0110) (00100) (001100) (0001000)
(101) (1001) (01010) (010010) (0010100)
(111) (1111) (01110) (011110) (0011100)
(10001) (100001) (0100010)
(10101) (101101) (0101010)
(11011) (110011) (0110001)
(11111) (111111) (0110110)
(0111001)
(0111110)
(1000001)
(1000110)
(1001001)
(1001110)
(1010101)
(1011101)
(1100011)
(1101011)
(1110111)
(1111111)
(End)
KEYWORD
nonn
AUTHOR
R. H. Hardin, Mar 10 2013
STATUS
approved