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

Offset: 0

Author

N. J. A. Sloane, Jul 17 2003

Keywords

• nonn
• tabl

Examples

			Triangle begins
1
1 1
1 1 1
1 1 1 1
1 1 1 1 1
1 1 2 2 1 1
		

Links

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

Crossrefs

Row sums are A057657.

Extensions

Row 10 from Brian Borchers (borchers(AT)nmt.edu), Apr 14 2005

Row 11 from Brian Borchers (borchers(AT)nmt.edu), Nov 04 2009