|
Search: id:A122086
|
|
|
| A122086 |
|
Number of unlabeled free bicolored trees with n nodes (the colors are not interchangeable). |
|
+0
3
|
|
| 2, 1, 2, 3, 6, 10, 22, 42, 94, 203, 470, 1082, 2602, 6270, 15482, 38525, 97258, 247448, 635910, 1645411, 4289010, 11245670, 29656148, 78595028, 209273780, 559574414, 1502130920, 4046853091, 10939133170, 29661655793
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Row sums of A122085.
|
|
REFERENCES
|
R. W. Robinson, Numerical implementation of graph counting algorithms, AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1978.
|
|
FORMULA
|
For n even, a(n) = 2*A000055(n) - A000081(n/2), for n odd, a(n) = 2*A000055(n).
|
|
CROSSREFS
|
Cf. A122085. Same as A125702 except for n = 1.
Adjacent sequences: A122083 A122084 A122085 this_sequence A122087 A122088 A122089
Sequence in context: A056493 A001371 A001037 this_sequence A082594 A051850 A077013
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas, Oct 19 2006
|
|
EXTENSIONS
|
Edited by Christian Bower (bowerc(AT)usa.net) and Franklin T. Adams-Watters (FrankTAW(AT)Netscape.net), Jan 05 2007
|
|
|
Search completed in 0.002 seconds
|
