Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A072247
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A072247 Triangle T(n,k) (n>=2, 2<=k<=n-1 if n>2) giving number of non-crossing trees with n nodes and k endpoints. +0
3
1, 3, 8, 4, 20, 30, 5, 48, 144, 75, 6, 112, 560, 595, 154, 7, 256, 1920, 3440, 1848, 280, 8, 576, 6048, 16380, 14994, 4788, 468, 9 (list; graph; listen)
OFFSET

0,2

COMMENT

For n>2 n-th row has n-2 terms.

REFERENCES

E. Deutsch and M. Noy, Statistics on non-crossing trees, Discr. Math., 254 (2002), 75-87.

EXAMPLE

1; 3; 8,4; 20,30,5; 48,144,75,6; ...

CROSSREFS

First column gives A001792, row sums are A001764.

Sequence in context: A021030 A010628 A106292 this_sequence A051359 A016670 A021726

Adjacent sequences: A072244 A072245 A072246 this_sequence A072248 A072249 A072250

KEYWORD

nonn,tabf

AUTHOR

njas, Jul 06 2002

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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research