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.

2, 5, 10, 16, 27, 40

Offset

1,1

References

Victor S. Miller, paper in preparation.

Links

Table of n, a(n) for n=1..6.

Crossrefs

Sequence in context: A049815 A047992 A079984 * A192701 A258601 A264300

Adjacent sequences: A027610 A027611 A027612 * A027614 A027615 A027616

Keyword

nonn

Author

Victor S. Miller

Status

approved