Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A000524
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A000524 Number of rooted trees with n nodes, 2 of which are labeled.
(Formerly M1927 N0761)
+0
11
2, 9, 34, 119, 401, 1316, 4247, 13532, 42712, 133816, 416770, 1291731, 3987444, 12266845, 37627230, 115125955, 351467506, 1070908135, 3257389088, 9892759091, 30002923380, 90879555521, 274963755791, 831064788976 (list; graph; listen)
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 16 17:18 EST 2009. Contains 170825 sequences.


AT&T Labs Research