login
The OEIS is supported by the many generous donors to the OEIS 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
Eric Weisstein's World of Mathematics, Connected Graph
Eric Weisstein's World of Mathematics, Untraceable 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
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 19:24 EDT 2024. Contains 371962 sequences. (Running on oeis4.)