32037

Appears in sequences

• Number of solutions to the equation p_i = (1+mod(i,2))*p_{i-1} +- p_{i-2} +- p_{i-3} +- ... +- 2 +- 1, where p_i is the i-th prime number (where p_1 = 2 and the "zeroth prime" p_0 is defined to be 1).at n=23A059871
• a(n) = prime(n)^2-4.at n=40A166010
• Sum of all parts > 1 of all partitions of n.at n=23A194552
• a(n) = prime(n)^2 - 4*prime(n).at n=39A245034