41485

Appears in sequences

• T(2n,n-1), T given by A026692.at n=7A026694
• Consider the Diophantine equation x^3 + y^3 = z^3 + 1 (1 < x < y < z) or 'Fermat near misses'. Sequence gives values of z in monotonic increasing order.at n=26A050791
• Expansion of 1/(1 - x - x^2 + x^5 - x^6).at n=24A257863
• Number of nX4 0..1 arrays with every element equal to 0, 1, 2, 4, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=6A300310
• Number of nX7 0..1 arrays with every element equal to 0, 1, 2, 4, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=3A300313
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 4, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=48A300314
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 4, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=51A300314