editing

approved

N. J. A. Sloane, <a href="http://neilsloane.com/docA265032/graphsa265032.html">Challenge Problems: Independent Sets in Graphs</a>

approved

editing

N. J. A. Sloane, <a href="http://www.research.attneilsloane.com/~njas/doc/graphs.html">Challenge Problems: Independent Sets in Graphs</a>

_N. J. A. Sloane (njas(AT)research.att.com), _, Jul 17 2003

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

nonn,tabl,new

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

nonn,tabl,new

N. J. A. Sloane (njas, (AT)research.att.com), Jul 17 2003

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

nonn,tabl,new

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

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

0,18

N. J. A. Sloane, <a href="http://www.research.att.com/~njas/doc/graphs.html">Challenge Problems: Independent Sets in Graphs</a>

Triangle begins

1

1 1

1 1 1

1 1 1 1

1 1 1 1 1

1 1 2 2 1 1

Row sums are A057657.

nonn,tabl

njas, Jul 17 2003

approved