|
Search: id:A007106
|
|
|
| A007106 |
|
Number of labeled odd degree trees with 2n nodes.
(Formerly M3704)
|
|
+0
6
|
|
| 1, 4, 96, 5888, 686080, 130179072, 36590059520, 14290429935616, 7405376630685696, 4917457306800619520, 4071967909087792857088, 4113850542422629363482624, 4980673081258443273955966976
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
R. W. Robinson, personal communication.
R. W. Robinson, Numerical implementation of graph counting algorithms, AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1976.
|
|
LINKS
|
R. W. Robinson, Table of n, a(n) for n = 1..39
Index entries for sequences related to trees
|
|
FORMULA
|
a(n) = A060279(n)/(2*n). - Vladeta Jovovic (vladeta(AT)Eunet.yu), Feb 08 2005
|
|
CROSSREFS
|
Adjacent sequences: A007103 A007104 A007105 this_sequence A007107 A007108 A007109
Sequence in context: A077155 A013042 A065140 this_sequence A111637 A027872 A098695
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
Corrected and extended by Vladeta Jovovic (vladeta(AT)Eunet.yu), Feb 08 2005
|
|
|
Search completed in 0.002 seconds
|
