# Hofstadter's Q-Sequence +100 XP pro

I am trying to solve the Code Coach problem below, but when I run it, the system tests 5 different inputs and tell me that only 2 ran properly. I am using a recursive method and my code is available in the bottom in Java. I fear that the SoloLearn online compiler is not fast enough to make all the interactions, then I would like to know if there is a lighter code possible to be written or if my code is wrong. Hofstadter's Q-Sequence +100 XP Hofstadter's Q-Sequence is a sequence of numbers where every integer above zero has a corresponding q-sequence value. You can determine the q-sequence value from a formula that tells you how far back in the sequence to go and add two values together. The first two values of the sequence are Q(1) = 1 and Q(2) = 1, and every number above 2 can be expressed according to the following formula (where n is your input value): Q(n) = Q(n - Q(n - 1)) + Q(n - Q(n -2)) Task: Given an integer value input, determine and output the corresponding q-sequence value. Input Format: A positive integer value. Output Format: A positive integer value that represents the value in the q-sequence that the input holds. Sample Input: 5 Sample Output: 3 ====================================================================== The Sequence can be seen in the following website in case you wish to compare it with the code's results: https://oeis.org/A005185/list ====================================================================== import java.util.Scanner; public class Qsequence { static int Q(int n){ if(n == 1 || n == 2){ return 1; } return Q(n - Q(n - 1)) + Q(n - Q(n -2)); } public static void main(String[] args) { Scanner scan = new Scanner(System.in); int x = scan.nextInt(); int output = Q(x); System.out.println(output); } } https://code.sololearn.com/cipdSnAeQ78k/#java