|
|
A198760
|
|
Number of initial spin configurations in two-colored rooted trees with n nodes.
|
|
7
|
|
|
2, 8, 32, 136, 596, 2712, 12642, 60234, 291840, 1434184, 7130640, 35807114, 181339236, 925139186, 4750176056, 24528421712, 127294780994, 663591911824, 3473315219722, 18246162722278, 96169600405626, 508413199626078, 2695245063006696, 14324688031734740
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
2,1
|
|
COMMENTS
|
Also the number of two-colored rooted trees that have for a given color of the root at least one nearest neighbor node of the root in the other color. - Martin Paech, Apr 16 2012
|
|
REFERENCES
|
G. Gruber, Entwicklung einer graphbasierten Methode zur Analyse von Hüpfsequenzen auf Butcherbäumen und deren Implementierung in Haskell, Diploma thesis, Marburg, 2011
|
|
LINKS
|
|
|
FORMULA
|
a(n) ~ c * d^n / n^(3/2), where d = A245870 = 5.6465426162329497128927135162..., c = 0.29201514711473716704145008728... . - Vaclav Kotesovec, Sep 12 2014
|
|
MAPLE
|
g:= proc(n, i, t) option remember; `if`(n=0, 1, `if`(i<1, 0, add(
binomial(t*g(i-1$2, 2)+j-1, j)*g(n-i*j, i-1, t), j=0..n/i)))
end:
a:= n-> 2*(g(n-1$2, 2) -g(n-1$2, 1)):
|
|
MATHEMATICA
|
g[n_, i_, t_] := g[n, i, t] = If[n == 0, 1, If[i < 1, 0, Sum[ Binomial[t*g[i-1, i-1, 2]+j-1, j]*g[n-i*j, i-1, t], {j, 0, n/i}]]]; a[n_] := 2*(g[n-1, n-1, 2] - g[n-1, n-1, 1]) // FullSimplify; Table[a[n], {n, 2, 30}] (* Jean-François Alcover, Nov 25 2014, after Alois P. Heinz *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|