Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A085680
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A085680 Size of largest code of length n and constant weight 2 that can correct a single adjacent transposition. +0
2
1, 1, 2, 3, 4, 6, 7, 9, 11, 13, 15, 17, 20, 23, 26, 29, 32, 36, 40, 44, 48, 52, 57, 62 (list; graph; listen)
OFFSET

2,3

LINKS

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

CROSSREFS

Column 2 of A085684.

Sequence in context: A062413 A064313 A011865 this_sequence A047872 A015851 A065156

Adjacent sequences: A085677 A085678 A085679 this_sequence A085681 A085682 A085683

KEYWORD

nonn

AUTHOR

njas, Jul 16 2003

page 1

Search completed in 0.002 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 July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research