55105

Appears in sequences

• a(n) = 3^n reduced modulo 2^n.at n=16A002380
• 9^n mod 4^n.at n=8A139729
• T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to or 1 greater than any north or southwest neighbors modulo n and the upper left element equal to 0.at n=60A267655
• Number of 6 X n arrays containing n copies of 0..6-1 with every element equal to or 1 greater than any north or southwest neighbors modulo 6 and the upper left element equal to 0.at n=5A267658
• Number of n X n arrays containing n copies of 0..n-1 with every element equal to or 1 greater than any west or northeast neighbors modulo n and the upper left element equal to 0.at n=5A267736
• Number of nX6 arrays of permutations of 6 copies of 0..n-1 with every element equal to or 1 greater than any west or northeast neighbors modulo n and the upper left element equal to 0.at n=5A267740
• Number of 6Xn arrays containing n copies of 0..6-1 with every element equal to or 1 greater than any west or northeast neighbors modulo 6 and the upper left element equal to 0.at n=5A267745