Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

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

$$3,8,17,32,57,\ldots$$ How do we find the $n^{th}$ term? I have been roaming aimlessly for a few minutes now. A definite pattern is in the differences of differences. Hints will be apreciated.

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


Taking the differences of consecutive terms $$5,9,15,25,\cdots$$

Taking the differences of consecutive terms $$4,6,10,\cdots$$

Taking the differences of consecutive terms $$2,4,\cdots,\text{ whose } n\text{ term } =2^n$$

The $n$ th term of $4,6,10,\cdots$ will be $2^n+(n$ th term of $2,2,2,\cdots)$ i.e., $2^n+2$

The $n$ th term of $5,9,15,25\cdots$ will be $2^n+2+(n$th term of $1,3,5,\cdots)$ i.e., $2^n+2+(2n-1)$

The $n$ th term of $3,8,17,32,57,\cdots$ will be $(2^n+2+2n-1)+(n$ th term of $-2,-1,2,7\cdots)$

Now the $n$ th term of $-2,-1,2,7\cdots$ can be found to be $(n-1)^2-2$ by similar difference method.

share|cite|improve this answer
Just so you know,there was a homework tag.But brilliant answer.Thanks for that. – rah4927 Jun 9 '13 at 17:28
@rah4927, my pleasure.In spite of homework, I had to complete it as the most complexity lies in the few lines – lab bhattacharjee Jun 9 '13 at 17:40
Yeah,I am not complaining though.I had figured out most of it before you posted it.But your answer provides completeness to the question. – rah4927 Jun 9 '13 at 17:43
@rah4927, nice to hear that. My idea is to solve a problem in a generic way, so that we can solve most of the similar problems – lab bhattacharjee Jun 9 '13 at 17:47
@rah4927, also this is a good link to recap… – lab bhattacharjee Jun 9 '13 at 17:49

From OEIS, the sequence is $$2^n + n^2$$

share|cite|improve this answer
I was hovering along the same direction almost.Thanks for the answer. – rah4927 Jun 9 '13 at 16:55

Let p(n) be the nth prime. Let o(n) be the nth term in OEIS sequence A190525, the number of n-step one-sided prudent walks. The given sequence is clearly:

p(1) + o(1), p(3) + o(2), p(5)+ o(3), p(7)+ o(4), p(9)+o(5),..., p(2n-1)+o(n).

share|cite|improve this answer

This can be anything you want, you only have to choose a particular pattern.

share|cite|improve this answer
I had forseen this answer even before I ever posted this question. – rah4927 Jun 9 '13 at 17:32

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.