Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A001225
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A001225 Consistent arcs in a tournament (equals C(n,2) - A003141).
(Formerly M1333 N0510)
+0
2
1, 2, 5, 7, 11, 14, 20, 24, 30, 35 (list; graph; listen)
OFFSET

2,2

REFERENCES

J.-C. Bermond, Ordres a` distance minimum d'un tournoi et graphs partiels sans circuits maximaux, Math. Sci. Hum., No. 37 (1972), 5-25.

K. B. Reid, On sets of arcs containing no cycles in tournaments, Canad. Math. Bull., 12 (1969), 261-264.

LINKS

Index entries for sequences related to tournaments

CROSSREFS

Sequence in context: A095272 A099835 A133436 this_sequence A134640 A032616 A006066

Adjacent sequences: A001222 A001223 A001224 this_sequence A001226 A001227 A001228

KEYWORD

nonn,nice

AUTHOR

njas

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 24 12:00 EDT 2008. Contains 142294 sequences.


AT&T Labs Research