query: Recursive Alegbraic Equation for binary trees?
positive_passages.docid: 149266
positive_passages.text: Possible distinct binary tree structures at depth d
negative_passages.docid: 26569
negative_passages.text: Counting binary operations on a set with $n$ elements
negative_passages.docid: 49802
negative_passages.text: How does recursive algorithm work for Towers of Hanoi?
negative_passages.docid: 158802
negative_passages.text: Graph theory and tree company
negative_passages.docid: 64658
negative_passages.text: How many associative binary operations for a set of two elements?
negative_passages.docid: 113953
negative_passages.text: Circular permutations with indistinguishable objects
negative_passages.docid: 78243
negative_passages.text: graph-theory problem about outdegree and indegree
negative_passages.docid: 96620
negative_passages.text: Condition on degrees for existence of a tree
negative_passages.docid: 100256
negative_passages.text: Proof by induction on a rooted tree with even number of vertices
negative_passages.docid: 41409
negative_passages.text: Ackermann Function primitive recursive
negative_passages.docid: 36611
negative_passages.text: Algorithms for solving the discrete logarithm $a^x \equiv b\pmod{n}$ when $\gcd(a,n) \neq 1$
negative_passages.docid: 128023
negative_passages.text: Recursive formulas and integration
negative_passages.docid: 39540
negative_passages.text: Efficient Algorithm for finding left (or right) Transversal in a Group
negative_passages.docid: 44013
negative_passages.text: How many trees over ${1,2,3,...n}$ with conditions
negative_passages.docid: 19790
negative_passages.text: How to deal with recursion formula in Mathematica?
negative_passages.docid: 155812
negative_passages.text: A Fermat's FLT look-like for matrices.
negative_passages.docid: 52443
negative_passages.text: Solving recurrence relation?