141235

Appears in sequences

• a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = 2*n - 2 - 2^(p+1) and p is the unique integer such that 2^p < n-1 <= 2^(p+1), with a(1) = a(2) = 1 and a(3) = 2.at n=16A049939
• Least k such that gcd(prime(k)+1, prime(k+1)+1) = 2n.at n=35A067603