login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A283421 Number of connected untraceable graphs on n vertices. 1
0, 0, 0, 1, 3, 21, 119, 1087, 12653, 233999, 6469055 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,5

LINKS

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

Eric Weisstein's World of Mathematics, Connected Graph

Eric Weisstein's World of Mathematics, Traceable Graph

FORMULA

a(n) = A001349(n) - A057864(n).

CROSSREFS

Cf. A000088 (number of simple graphs on n vertices).

Cf. A001349 (number of simple connected graphs on n vertices).

Cf. A057864 (number of traceable simple graphs on n vertices).

Cf. A283420 (number of simple untraceable not necessarily connected graphs on n vertices).

Sequence in context: A178537 A084159 A046727 * A117512 A068127 A247247

Adjacent sequences:  A283418 A283419 A283420 * A283422 A283423 A283424

KEYWORD

nonn,more

AUTHOR

Eric W. Weisstein, May 14 2017

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 September 28 13:24 EDT 2020. Contains 337393 sequences. (Running on oeis4.)