OFFSET
1,4
COMMENTS
A persymmetric (or Hankel) matrix has M[i,j] = M[i-k,j+k] for all i and j (matrix is constant along antidiagonals).
EXAMPLE
Examples achieving the maximum, given as a binary string of length 2n-1 whose length-n sliding windows give the successive rows of the matrix:
1 1
2 101
3 01110
4 0011010
5 000110101
6 00101100101
7 1010110010111
8 000101110010110
9 01100010111100110
10 0110101110010010111
11 010011010111001001010
12 00001011011100010110110
13 1001010100111100100010011
14 000010111010110001101110101
15 00010110100111011101001011000
CROSSREFS
KEYWORD
nonn,hard,more
AUTHOR
John W. Layman, Aug 10 2004
EXTENSIONS
a(9)-a(12) from Max Alekseyev, Jun 16 2008
a(13)-a(15) from Pontus von Brömssen, Jan 30 2026
STATUS
approved
