A027613 - OEIS

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.

%I #3 Mar 31 2012 21:03:54

%S 2,5,10,16,27,40

%N 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.

%D Victor S. Miller, paper in preparation.

%K nonn

%O 1,1

%A _Victor S. Miller_