40985

Appears in sequences

• Least k such that gcd(prime(k)+1, prime(k+1)+1) = 2n.at n=27A067603
• Numbers n such that n!8 + 2 is prime.at n=56A204663
• Odd numbers n for which the number of iterations to reach the largest equals number of iterations to reach 1 from the largest in Collatz (3x+1) trajectory of n.at n=16A224533
• Number of standard Young tableaux with n cells such that the lengths of the first and the last row differ by 3.at n=7A244297