55872

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=24A059871
• a(n) = 97*n^2.at n=24A174338
• a(n) = smallest k such that prime(n) is the n-th largest divisor of k.at n=24A226326
• Numbers such that the largest prime factor equals the sum of the 4th power of the other prime factors.at n=25A244344
• a(n) = n! * [x^n] exp(n*x)*tan(x).at n=6A302586