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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A054960 Number of unlabeled graphs with n nodes and an odd number of edges. 7
0, 1, 2, 5, 16, 78, 522, 6168, 137316, 6002584, 509498932, 82545585936, 25251015681176, 14527077828617744, 15713242984902154384, 32000507852263778595584, 122967932076766466336249888 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

LINKS

V. A. Liskovets, Some easily derivable sequences, J. Integer Sequences, 3 (2000), #00.2.2.

FORMULA

a(n)=(A000088(n)-A000171(n))/2.

CROSSREFS

Cf. A007869 for graphs with an even number of edges.

Sequence in context: A020127 A179500 A121396 * A004110 A048754 A176343

Adjacent sequences:  A054957 A054958 A054959 * A054961 A054962 A054963

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), May 24 2000

EXTENSIONS

More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Jul 19 2000

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 10:05 EST 2012. Contains 206009 sequences.