login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A007150 2-part of number of tournaments on n nodes.
(Formerly M0269)
0
0, 0, 1, 2, 2, 3, 3, 5, 4, 6, 5, 7, 6, 7, 7, 10, 8, 9, 9, 12, 10, 11, 11, 14, 12, 14, 13, 15, 14, 17, 15, 19, 16, 20, 17, 19, 18, 19, 19, 26, 20, 22, 21, 23, 22, 23, 23, 30, 24, 26, 25, 28, 26 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

REFERENCES

Steven C. Cater and Robert W. Robinson, ``Exponents of 2 in the numbers of unlabeled graphs and tournaments,'' Congressus Numerantium, 82 (1991), pp. 139-155.

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

Table of n, a(n) for n=1..53.

Steven C. Cater and Robert W. Robinson, Exponents of 2 in the numbers of unlabeled graphs and tournaments, Preprint. (Annotated scanned copy)

Index entries for sequences related to tournaments

CROSSREFS

Power of 2 dividing A000568(n).

Sequence in context: A252463 A113605 A070230 * A213634 A300271 A252461

Adjacent sequences:  A007147 A007148 A007149 * A007151 A007152 A007153

KEYWORD

nonn

AUTHOR

N. J. A. Sloane.

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 13 12:49 EST 2018. Contains 318086 sequences. (Running on oeis4.)