52506

Appears in sequences

• a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2, and a(3) = 1.at n=18A049901
• Inverse Moebius transform of A000031 (starting at term 0).at n=20A054058
• Sum of the first n n-digit primes less n*10^(n-1).at n=37A114053