login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A095337 Total number of leaves and degree-1 roots in the rooted trees of order n. 0
0, 2, 4, 10, 26, 67, 180, 482, 1319, 3627, 10082, 28150, 79142, 223309, 632805, 1798614, 5127257, 14650352, 41952791, 120358095, 345878470, 995441814, 2868762513, 8277505162, 23910288016, 69136464102, 200092471111, 579592538321, 1680177087348 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

LINKS

Eric Weisstein's World of Mathematics, Tree Leaf

W. Bomfim, The nine rooted trees with five nodes

W. Bomfim, C program around function Gen() (rooted trees generation) of Gang Li & Frank Ruskey.

EXAMPLE

See the 26 red nodes in first Bomfim link. So a(5) = 26.

CROSSREFS

Sequence in context: A090377 A151278 A149810 * A162533 A052995 A055819

Adjacent sequences:  A095334 A095335 A095336 * A095338 A095339 A095340

KEYWORD

nonn

AUTHOR

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

EXTENSIONS

a(13)-a(29) from - W. Bomfim, Jan 29 2011

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 14:50 EST 2012. Contains 206050 sequences.