OFFSET
0,1
COMMENTS
A rooted tree is binary if each internal node has two children, a left child and a right child.
LINKS
Jan A. Bergstra, Alban Ponse, Daan J. C. Staudt, Propositional logic with short-circuit evaluation: a non-commutative and a commutative variant, arXiv:1810.02142 [cs.LO], 2018.
H. Buhrman and R. de Wolf, Complexity Measures and Decision Tree Complexity: A Survey, Theoretical Computer Science, Vol. 288, no. 1 (2002), 21-43.
FORMULA
a(n) = n*(a(n-1))^2 + 2.
MATHEMATICA
a[0] = 2; a[n_] := n*a[n - 1]^2 + 2; Table[ a[n], {n, 0, 8} ]
RecurrenceTable[{a[0]==2, a[n]==n*a[n-1]^2+2}, a, {n, 7}] (* Harvey P. Dale, Dec 18 2015 *)
CROSSREFS
KEYWORD
easy,nice,nonn
AUTHOR
Clifford Smyth (csmyth(AT)ias.edu), Nov 14 2001
EXTENSIONS
One more term from Robert G. Wilson v, Nov 15 2001
STATUS
approved