Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A023053
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A023053 Number of noncrossing rooted trees with n nodes on a circle that do not have leaves at level 1. +0
2
1, 0, 2, 7, 34, 171, 905, 4952, 27802, 159254, 927081, 5468960, 32621669, 196422509, 1192294778, 7288208927, 44825586130, 277196752569, 1722454028174, 10749430579118, 67346519863117, 423425225290485 (list; graph; listen)
OFFSET

1,3

LINKS

Index entries for sequences related to rooted trees

FORMULA

sum((-1)^i*(i+1)*binomial(3*n-2*i, n-i)/(2*n-i+1), i=0..n); G.f.: g/(1+zg) where g = 1 + z g^3, g(0) = 1 or g := 2*sin(arcsin(sqrt(27*z)/2)/3)/sqrt(3*z).

CROSSREFS

Sequence in context: A014623 A144005 A143889 this_sequence A058915 A020054 A117399

Adjacent sequences: A023050 A023051 A023052 this_sequence A023054 A023055 A023056

KEYWORD

nonn

AUTHOR

Emeric Deutsch (deutsch(AT)duke.poly.edu)

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 November 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research