Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A004115
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A004115 Number of unlabeled rooted nonseparable graphs with n nodes.
(Formerly M3592)
+0
3
0, 1, 1, 4, 22, 178, 2278, 46380, 1578060, 92765486, 9676866173, 1821391854302, 625710416245358, 395761853562201960, 464128290507379386872, 1015085639712281997464676, 4160440039279630394986003604 (list; graph; listen)
OFFSET

1,4

REFERENCES

R. W. Robinson, personal communication.

R. W. Robinson, Numerical implementation of graph counting algorithms, AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1976.

LINKS

R. W. Robinson, Table of n, a(n) for n = 1..26

CROSSREFS

Cf. A002218, A013922.

Sequence in context: A113351 A001827 A125863 this_sequence A112370 A002728 A062494

Adjacent sequences: A004112 A004113 A004114 this_sequence A004116 A004117 A004118

KEYWORD

nonn,nice

AUTHOR

njas

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 July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research