Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Is there any way to solve the recurrence


I know how to solve recurrences with z-transforms, but it doesn't look like that technique will yield anything useful here. I have a feeling I'll be able to work around this if worse comes to worse, but a solution to this recurrence would simplify things greatly.

share|cite|improve this question
up vote 3 down vote accepted

First simplify the recurrence by defining $\ y[n]:=x[n]+1\ $ then you want : $$y[n+1]=y[n]\,2^{y[n]}$$ Let's set $\ u[n]:=\log_2(y[n])\ $ to get smaller values then the $\log$ in base $2$ of the last recurrence will give : $$u[n+1]=u[n]+y[n]=u[n]+2^{u[n]}$$ This fast growing sequence appears as sequence A034797 of OEIS (when $a[0]=1$ at least) with reference to this paper 'Sloping Binary Numbers: A New Sequence Related to the Binary Numbers' from Applegate, Cloitre, Deléham and Sloane (see around $(29)$).

Hoping this helped,

share|cite|improve this answer
By the looks of things, something is known of the recurrence then, but I don't see a closed form of it anywhere. Looks like it's time to work on that Plan B then. Thanks. – Mike Dec 6 '12 at 23:44
@Mike: you are welcome! – Raymond Manzoni Dec 7 '12 at 0:00

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.