38020

Appears in sequences

• a(n) = number of solutions to the Diophantine equation x+y^2+z^3=n^4 with positive x,y,z all distinct.at n=24A121984
• a(n) = 25*n^2 - 5.at n=38A158446
• E.g.f. satisfies: A(x) = (1 + x*A(x)^2)^A(x).at n=5A162863
• Number of (n+2)X3 binary arrays with every 2X2 subblock sum equal to some diagonal or antidiagonal neighbor 2X2 subblock sum.at n=6A187932
• Number of (n+2)X9 binary arrays with every 2X2 subblock sum equal to some diagonal or antidiagonal neighbor 2X2 subblock sum.at n=0A187938
• T(n,k)=Number of (n+2)X(k+2) binary arrays with every 2X2 subblock sum equal to some diagonal or antidiagonal neighbor 2X2 subblock sum.at n=21A187940
• T(n,k)=Number of (n+2)X(k+2) binary arrays with every 2X2 subblock sum equal to some diagonal or antidiagonal neighbor 2X2 subblock sum.at n=27A187940
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 7", based on the 5-celled von Neumann neighborhood.at n=37A270012
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 7", based on the 5-celled von Neumann neighborhood.at n=38A270012
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 261", based on the 5-celled von Neumann neighborhood.at n=38A271062
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 337", based on the 5-celled von Neumann neighborhood.at n=38A271287
• Number of nX6 0..1 arrays with every element unequal to 0, 1, 2, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=7A316691