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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A054926 Number of connected unlabeled graphs with n nodes and floor(n*(n-1)/4) edges. 1
1, 0, 0, 2, 5, 19, 132, 1579, 33366, 1343120, 105723785, 15968704512, 4520384306832, 2402302590759788, 2425409960013204929, 4647586298937784001491, 16787189663016572148130262, 114715448859703502223876433517 (list; graph; refs; listen; history; internal format)
OFFSET

1,4

LINKS

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

FORMULA

a(n) = A054924(n, floor(n*(n-1)/4) ).

CROSSREFS

Sequence in context: A089126 A113346 A198945 * A002786 A039719 A198203

Adjacent sequences:  A054923 A054924 A054925 * A054927 A054928 A054929

KEYWORD

nonn,easy

AUTHOR

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

EXTENSIONS

Description corrected by David Wasserman (wasserma(AT)spawar.navy.mil), Mar 05 2002

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 15 14:20 EST 2012. Contains 205811 sequences.