Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A101488
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A101488 Number of naturally embedded binary trees that have no label greater than 0. +0
2
1, 1, 1, 2, 4, 10, 26, 73, 213, 645, 2007, 6391, 20741, 68407, 228753, 774162, 2647548, 9138342, 31802118, 111489492, 393442848, 1396771812, 4985732628, 17884908282, 64449398994, 233220788850, 847211744806, 3088649627798 (list; graph; listen)
OFFSET

0,4

LINKS

M. Bousquet-Melou, Limit laws for embedded trees

FORMULA

G.f.: [(1-4z)^(3/2)-1+8z-2z^2]/[2z(1+z)].

CROSSREFS

First row of array A101489.

Adjacent sequences: A101485 A101486 A101487 this_sequence A101489 A101490 A101491

Sequence in context: A049145 A102407 A049130 this_sequence A089429 A049143 A089404

KEYWORD

nonn

AUTHOR

Ralf Stephan, Jan 21 2005

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 October 7 14:39 EDT 2008. Contains 144666 sequences.


AT&T Labs Research