

A007149


2part of number of graphs on n nodes.
(Formerly M0017)


3



0, 0, 1, 2, 0, 1, 2, 2, 1, 2, 4, 3, 4, 4, 5, 5, 4, 5, 8, 6, 8, 7, 8, 8, 9, 9, 10, 10, 15, 11, 12, 12, 11, 12, 16, 13, 16, 14, 15, 15, 17, 16, 17, 17, 19, 18, 19, 19, 20, 20, 21, 21, 23, 22, 23, 23
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,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. 139155.
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=0..55.
Steven C. Cater and Robert W. Robinson, Exponents of 2 in the numbers of unlabeled graphs and tournaments, Preprint. (Annotated scanned copy)


CROSSREFS

Power of 2 dividing A000088.
Sequence in context: A065051 A084665 A035392 * A028832 A260411 A199331
Adjacent sequences: A007146 A007147 A007148 * A007150 A007151 A007152


KEYWORD

nonn


AUTHOR

N. J. A. Sloane.


STATUS

approved



