login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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
2, 5, 10, 16, 27, 40 (list; graph; refs; listen; history; text; internal format)
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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 23 16:28 EST 2020. Contains 332179 sequences. (Running on oeis4.)