52149

Appears in sequences

• 24 'Reverse and Add' steps are needed to reach a palindrome.at n=12A065318
• Number of nX3 arrays containing 3 copies of 0..n-1 with no element 1 greater than its north, northeast or northwest neighbor modulo n and the upper left element equal to 0.at n=4A266885
• T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element 1 greater than its north, northeast or northwest neighbor modulo n and the upper left element equal to 0.at n=25A266886
• Number of 5Xn arrays containing n copies of 0..5-1 with no element 1 greater than its north, northeast or northwest neighbor modulo 5 and the upper left element equal to 0.at n=2A266889