Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A095349
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A095349 Total number of edges in all trees on n nodes. +0
1
0, 1, 2, 6, 12, 30, 66, 161, 376, 954, 2350, 6061, 15612, 41067, 108374, 289800, 778064, 2105739, 5723190, 15638235, 42890100, 118098876, 326217628, 903897631, 2511285360, 6994836250, 19527701960, 54632961864, 153147864380 (list; graph; listen)
OFFSET

1,3

LINKS

Eric Weisstein's World of Mathematics, Graph Edge

FORMULA

a(n) = (n-1)*A000055(n). - Vladeta Jovovic (vladeta(AT)eunet.rs), Jun 05 2004

CROSSREFS

Cf. A055543.

Sequence in context: A129912 A161507 A032177 this_sequence A022916 A073949 A080372

Adjacent sequences: A095346 A095347 A095348 this_sequence A095350 A095351 A095352

KEYWORD

nonn

AUTHOR

Eric Weisstein (eric(AT)weisstein.com), Jun 03, 2004

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 December 11 12:57 EST 2009. Contains 170656 sequences.


AT&T Labs Research