57040

Appears in sequences

• a(n) = n*(n+1)*(2*n+1)*(3*n+1)/6.at n=15A011195
• Number of (n+1) X 2 binary arrays with every 2 X 2 subblock trace equal to some horizontal or vertical neighbor 2 X 2 subblock trace.at n=9A185742
• Consider a number x > 1. Take the sum of its digits. Repeat the process deleting the first addendum and adding the previous sum. The sequence lists the numbers that after some iterations reach the Euler totient function of x.at n=22A269310
• Numbers k such that 405*2^k+1 is prime.at n=30A323102