42810

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), starting with a(1) = 1, a(2) = 3, and a(3) = 2.at n=18A049923
• Numbers n such that 54 'Reverse and Add' steps are needed to reach a palindrome.at n=14A065321
• Sigma(n)-n values in A085844.at n=37A216383
• Number of n X 3 arrays of occupancy after each element moves to some horizontal or antidiagonal neighbor, without move-in move-out left turns.at n=6A221604
• T(n,k)=Number of nXk arrays of occupancy after each element moves to some horizontal or antidiagonal neighbor, without move-in move-out left turns.at n=42A221609
• Number of 7Xn arrays of occupancy after each element moves to some horizontal or antidiagonal neighbor, without move-in move-out left turns.at n=2A221615