45897

Appears in sequences

• Number of n X n 0..1 arrays with every element equal to 0, 1, 3, 4 or 5 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=5A302871
• Number of nX6 0..1 arrays with every element equal to 0, 1, 3, 4 or 5 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=5A302875
• Number of 6Xn 0..1 arrays with every element equal to 0, 1, 3, 4 or 5 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=5A302881
• Number of nX4 0..1 arrays with every element unequal to 1, 2, 3, 6 or 8 king-move adjacent elements, with upper left element zero.at n=13A305485
• a(n) is the smallest integer k such that the Diophantine equation x^3 + y^3 + z^3 = k^3 has exactly n positive primitive integer solutions.at n=11A391773