Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A054926
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A054926 Number of connected unlabeled graphs with n nodes and floor(n*(n-1)/4) edges. +0
2
1, 0, 0, 2, 5, 19, 132, 1579, 33366 (list; graph; listen)
OFFSET

1,4

LINKS

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

CROSSREFS

Can be read off rows of A054924.

Sequence in context: A107882 A089126 A113346 this_sequence A002786 A039719 A014466

Adjacent sequences: A054923 A054924 A054925 this_sequence A054927 A054928 A054929

KEYWORD

nonn,easy

AUTHOR

njas, May 24 2000

EXTENSIONS

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 21 14:49 EST 2008. Contains 150807 sequences.


AT&T Labs Research