Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A082938
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A082938 Number of solid 2-trees with 2n+1 edges. +0
1
1, 1, 1, 2, 5, 13, 49, 201, 940, 4643, 24037, 127859, 696365, 3858759, 21704863, 123619126, 711787259, 4137614454, 24256010068, 143271593982, 852001881614, 5097719884665, 30670572676389, 185466705697057 (list; graph; listen)
OFFSET

0,4

LINKS

M. Bousquet and C. Lamathe, Enumeration of solid trees according to edge number and edge degree distribution, Discr. Math., 298 (2005), 115-141.

FORMULA

a(n) = (A047749(n)+A054423(n))/2. - Vladeta Jovovic (vladeta(AT)Eunet.yu), Sep 11 2004

CROSSREFS

Adjacent sequences: A082935 A082936 A082937 this_sequence A082939 A082940 A082941

Sequence in context: A079573 A067021 A098716 this_sequence A059103 A112836 A105905

KEYWORD

nonn

AUTHOR

njas, May 26 2003

EXTENSIONS

More terms from Vladeta Jovovic (vladeta(AT)Eunet.yu), Sep 11 2004

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 13 09:05 EDT 2008. Contains 145008 sequences.


AT&T Labs Research