Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A000683
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A000683 Number of 2-colored labeled graphs on n nodes.
(Formerly M4238 N1770)
+0
11
0, 1, 6, 40, 360, 4576, 82656, 2122240, 77366400, 4002843136, 293717546496, 30558458490880, 4505780560619520, 941417163728674816, 278628902101315608576, 116805328001281573519360 (list; graph; listen)
OFFSET

1,3

REFERENCES

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, NY, 1973, p. 18, table 1.5.1, column 2 (divided by 2).

R. C. Read, The number of k-colored graphs on labeled nodes, Canad. J. Math., 12 (1960), 410-414.

R. C. Read, personal communication.

LINKS

T. D. Noe, Table of n, a(n) for n=1..50

FORMULA

Reference gives generating function.

CROSSREFS

a(n)=(A047863(n)-2)/4. A diagonal of A058843.

Sequence in context: A083805 A006387 A014481 this_sequence A143342 A084270 A053677

Adjacent sequences: A000680 A000681 A000682 this_sequence A000684 A000685 A000686

KEYWORD

nonn,nice,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

EXTENSIONS

More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Feb 02 2000

page 1

Search completed in 0.004 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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research