28755

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=22A121984
• Number of strings of numbers x(i=1..7) in 0..n with sum i*x(i)^3 equal to 7*n^3.at n=20A184724
• T(n,k)=Number of nX(k+1) 0..2 arrays with every row least squares fitting to a positive slope straight line and every column least squares fitting to a zero or positive slope straight line, with a single point array taken as having zero slope.at n=36A223309
• Number of 1X(n+1) 0..2 arrays with every row least squares fitting to a positive slope straight line and every column least squares fitting to a zero or positive slope straight line, with a single point array taken as having zero slope.at n=8A223310
• G.f. A(x) satisfies 1 = Sum_{n>=0} x^n * (1 + x*A(x)^(n+1))^n / A(x)^(n+1).at n=11A385914