A085685 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A085685

Triangle read by rows: T(n,k), n >= 0, 0 <= k <= n, is size of maximal 1-transposition-correcting code formed using binary vectors of length n and weight k. The end-around transposition is allowed.

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 2, 3, 6, 3, 2, 1, 1, 2, 4, 7, 7, 4, 2, 1, 1, 2, 6, 10, 12, 10, 6, 2, 1, 1, 3, 7, 18, 21, 21, 18, 7, 3, 1, 1, 3, 9, 21, 33, 37, 33, 21, 9, 3, 1, 1, 3, 11, 28, 52, 63, 63, 52, 28, 11, 3, 1

(list; table; graph; refs; listen; history; text; internal format)

OFFSET

0,18

LINKS

Table of n, a(n) for n=0..77.

N. J. A. Sloane, Challenge Problems: Independent Sets in Graphs

EXAMPLE

Triangle begins

1 1

1 1 1

1 1 1 1

1 1 1 1 1