Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A006201
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A006201 Number of 3-colored labeled graphs on n nodes.
(Formerly M5167)
+0
5
0, 0, 1, 24, 640, 24000, 1367296, 122056704, 17282252800, 3897054412800, 1400795928395776, 802530102499344384, 732523556206878392320, 1064849635418836398243840, 2464403435614136308036796416 (list; graph; listen)
OFFSET

1,4

REFERENCES

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

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

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

R. C. Read, personal communication.

CROSSREFS

Cf. A000683. A diagonal of A058843.

Sequence in context: A097192 A126153 A002553 this_sequence A118051 A160038 A093456

Adjacent sequences: A006198 A006199 A006200 this_sequence A006202 A006203 A006204

KEYWORD

nonn,easy,nice

AUTHOR

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

EXTENSIONS

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

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 23 10:40 EST 2009. Contains 167421 sequences.


AT&T Labs Research