|
Search: id:A027613
|
|
|
| A027613 |
|
Degrees of polynomials involved in analysis of a binary-tree valued Markov chain depending on one parameter; each polynomial has a unique root in [ 0,1 ], which is a lower bound for the transition from positive recurrence to null recurrence. |
|
+0
1
|
| |
|
|
|
|
Search completed in 0.002 seconds
|
