36292

Appears in sequences

• Nonnegative values x of solutions (x, y) to the Diophantine equation x^2+(x+833)^2 = y^2.at n=37A129010
• Number of n X 4 nonnegative integer arrays with upper left 0 and every value within 3 of its city block distance from the upper left and every value increasing by 0 or 1 with every step right or down.at n=5A252824
• Number of nX6 nonnegative integer arrays with upper left 0 and every value within 3 of its city block distance from the upper left and every value increasing by 0 or 1 with every step right or down.at n=3A252826
• T(n,k)=Number of nXk nonnegative integer arrays with upper left 0 and every value within 3 of its city block distance from the upper left and every value increasing by 0 or 1 with every step right or down.at n=39A252828
• T(n,k)=Number of nXk nonnegative integer arrays with upper left 0 and every value within 3 of its city block distance from the upper left and every value increasing by 0 or 1 with every step right or down.at n=41A252828
• Numbers k such that k^4096 + (k+1)^4096 is prime.at n=17A274236