--- title: Hofstadter Q sequence id: 59637c4d89f6786115efd814 challengeType: 5 forumTopicId: 302287 --- ## Description
The Hofstadter Q sequence is defined as: $Q(1)=Q(2)=1, \\ Q(n)=Q\big(n-Q(n-1)\big)+Q\big(n-Q(n-2)), \quad n>2.$ It is defined like the Fibonacci sequence, but whereas the next term in the Fibonacci sequence is the sum of the previous two terms, in the Q sequence the previous two terms tell you how far to go back in the Q sequence to find the two numbers to sum to make the next term of the sequence.
## Instructions
Implement the Hofstadter Q Sequence equation as a function. The function should accept number, n, and return an integer.
## Tests
```yml tests: - text: hofstadterQ should be a function. testString: assert(typeof hofstadterQ === 'function'); - text: hofstadterQ() should return integer testString: assert(Number.isInteger(hofstadterQ(1000))); - text: hofstadterQ(1000) should return 502 testString: assert.equal(hofstadterQ(testCase[0]), res[0]); - text: hofstadterQ(1500) should return 755 testString: assert.equal(hofstadterQ(testCase[1]), res[1]); - text: hofstadterQ(2000) should return 1005 testString: assert.equal(hofstadterQ(testCase[2]), res[2]); - text: hofstadterQ(2500) should return 1261 testString: assert.equal(hofstadterQ(testCase[3]), res[3]); ```
## Challenge Seed
```js function hofstadterQ(n) { return n; } ```
### After Test
```js const testCase = [1000, 1500, 2000, 2500]; const res = [502, 755, 1005, 1261]; ```
## Solution
```js function hofstadterQ (n) { const memo = [1, 1, 1]; const Q = function (i) { let result = memo[i]; if (typeof result !== 'number') { result = Q(i - Q(i - 1)) + Q(i - Q(i - 2)); memo[i] = result; } return result; }; return Q(n); } ```