id:A085685 - OEIS Search Results

Search: id:A085685

Displaying 1-1 of 1 results found.

page 1

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.

+0
2

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; listen)

	OFFSET	`0,18`
	LINKS	`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 1` `1 1 2 2 1 1`
	CROSSREFS	`Row sums are A057657.` `Sequence in context: A027926 A114730 A031282 this_sequence A112465 A112468 A086275` `Adjacent sequences: A085682 A085683 A085684 this_sequence A085686 A085687 A085688`
	KEYWORD	`nonn,tabl,new`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), Jul 17 2003`
	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`

page 1

Search completed in 0.002 seconds

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.

AT&T Labs Research