# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a085685
Showing 1-1 of 1

%I A085685 #8 Dec 06 2015 08:58:30
%S A085685 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,
%T A085685 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,
%U A085685 21,9,3,1,1,3,11,28,52,63,63,52,28,11,3,1
%N 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.
%H A085685 N. J. A. Sloane, <a href="/A265032/a265032.html">Challenge Problems: Independent Sets in Graphs</a>
%e A085685 Triangle begins
%e A085685 1
%e A085685 1 1
%e A085685 1 1 1
%e A085685 1 1 1 1
%e A085685 1 1 1 1 1
%e A085685 1 1 2 2 1 1
%Y A085685 Row sums are A057657.
%K A085685 nonn,tabl
%O A085685 0,18
%A A085685 _N. J. A. Sloane_, Jul 17 2003
%E A085685 Row 10 from Brian Borchers (borchers(AT)nmt.edu), Apr 14 2005
%E A085685 Row 11 from Brian Borchers (borchers(AT)nmt.edu), Nov 04 2009

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE