Once again I wonder about the binary partition function and Jay's approximation.

For both it seems 0 is a fixpoint ( of the recurrence ! ).

So it seems intuitive to conjecture that for both functions we have

f ( a + oo i ) = 0.

This is similar to what happens to the fixpoints of the recursions for tetration , gamma and others.

Im not sure about solutions to f(z) = 0.

Maybe some initial conditions/parameters matter here.

Im aware this is all very informal , but that is the issue here : making things formal.

Or maybe Im wrong ?

regards

tommy1729

For both it seems 0 is a fixpoint ( of the recurrence ! ).

So it seems intuitive to conjecture that for both functions we have

f ( a + oo i ) = 0.

This is similar to what happens to the fixpoints of the recursions for tetration , gamma and others.

Im not sure about solutions to f(z) = 0.

Maybe some initial conditions/parameters matter here.

Im aware this is all very informal , but that is the issue here : making things formal.

Or maybe Im wrong ?

regards

tommy1729