Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A091848
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A091848 Johnson bound J(n,4,2). +0
2
1, 1, 2, 3, 3, 4, 5, 6, 7, 8, 9, 11, 12, 14, 15, 17, 18, 21, 22, 25, 26, 29, 30, 33, 35, 38, 40, 44, 45, 49, 51, 55, 57, 61, 63, 68, 70, 75 (list; graph; listen)
OFFSET

7,3

REFERENCES

W. Chu and C. J. Colbourn, Optimal (n,4,2)-OCC of small orders, Discrte Math., 279 (2004), 163-172.

F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, Elsevier-North Holland, 1978, p. 527, Cor. 5.

CROSSREFS

Cf. A091848.

Sequence in context: A034886 A011882 A025767 this_sequence A017886 A029038 A011877

Adjacent sequences: A091845 A091846 A091847 this_sequence A091849 A091850 A091851

KEYWORD

nonn,easy,more

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Mar 13 2004

EXTENSIONS

Sequence should also be extended backwards to n=1.

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 November 27 14:50 EST 2009. Contains 167570 sequences.


AT&T Labs Research