Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A085684
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A085684 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. +0
3
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 1, 1, 2, 3, 3, 2, 1, 1, 2, 4, 6, 4, 2, 1, 1, 3, 6, 9, 9, 6, 3, 1, 1, 3, 7, 13, 15, 13, 7, 3, 1, 1, 3, 9, 18, 24, 24, 18, 9, 3, 1, 1, 4, 11, 24, 37, 42, 37, 24, 11, 4, 1 (list; table; graph; listen)
OFFSET

0,12

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 2 2 2 1

1 2 3 3 2 1

1 2 4 6 4 2 1

CROSSREFS

Column k=1 is floor(n/3), column k=2 is A085680, row sums are A057608.

Adjacent sequences: A085681 A085682 A085683 this_sequence A085685 A085686 A085687

Sequence in context: A091237 A143477 A134143 this_sequence A141604 A143996 A071338

KEYWORD

nonn,tabl

AUTHOR

njas, Jul 17 2003

page 1

Search completed in 0.006 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 9 14:06 EDT 2008. Contains 144831 sequences.


AT&T Labs Research