Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A001895
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A001895 Number of rooted planar 2-trees with n nodes.
(Formerly M1258 N0481)
+0
1
1, 2, 4, 12, 34, 111, 360, 1226, 4206, 14728, 52024, 185824, 668676, 2424033, 8839632, 32412270, 119410390, 441819444, 1641032536, 6116579352, 22870649308, 85764947502, 322476066224, 1215486756372, 4591838372044 (list; graph; listen)
OFFSET

1,2

REFERENCES

Harary, Frank; and Palmer, Edgar M.; On acyclic simplicial complexes. Mathematika 15 1968 115-122.

F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, NY, 1973, p. 78, (3.5.28).

LINKS

T. D. Noe, Table of n, a(n) for n=1..200

Index entries for sequences related to rooted trees

Index entries for sequences related to trees

FORMULA

G.f.: (4-8*x^2-sqrt(1-4*x)-(3+2*x)*sqrt(1-4*x^2))/(8*x^2).

CROSSREFS

Cf. A000108, A000207.

Sequence in context: A027695 A005028 A108530 this_sequence A069727 A019447 A112083

Adjacent sequences: A001892 A001893 A001894 this_sequence A001896 A001897 A001898

KEYWORD

nonn,nice,easy

AUTHOR

njas

EXTENSIONS

More terms from Vladeta Jovovic (vladeta(AT)Eunet.yu), Aug 24 2001

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 23 17:35 EDT 2008. Contains 142285 sequences.


AT&T Labs Research