40298

Appears in sequences

• Number of nX3 arrays containing 3 copies of 0..n-1 with no element 1 greater than its north, southwest or southeast neighbor modulo n and the upper left element equal to 0.at n=4A266920
• T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element 1 greater than its north, southwest or southeast neighbor modulo n and the upper left element equal to 0.at n=25A266921
• Number of 5Xn arrays containing n copies of 0..5-1 with no element 1 greater than its north, southwest or southeast neighbor modulo 5 and the upper left element equal to 0.at n=2A266924
• a(n) = a(n-1) + a(n-2) + 2*a(floor(n/2)) + 3*a(floor(n/3)) + ... + n*a(floor(n/n)), where a(0) = 1, a(1) = 1, a(2) = 1.at n=17A298369