login
A283420
Number of simple (not necessarily connected) untraceable graphs on n nodes.
18
0, 1, 2, 6, 16, 65, 310, 2316, 26241, 522596, 18766354
OFFSET
1,3
FORMULA
a(n) = A000088(n) - A057864(n).
CROSSREFS
Cf. A000088 (number of simple graphs on n vertices).
Cf. A057864 (number of simple traceable graphs on n vertices).
Cf. A283421 (number of simple connected untraceable graphs on n vertices).
The labeled case is A326205.
The directed case is A326224 (with loops).
Unlabeled simple graphs not containing a Hamiltonian cycle are A246446.
Sequence in context: A363587 A150032 A373452 * A121749 A009386 A009605
KEYWORD
nonn,more
AUTHOR
Eric W. Weisstein, May 14 2017
STATUS
approved