75263

Appears in sequences

• T(n,n-4), array T as in A038792.at n=37A038794
• Numerators of continued fraction convergents to sqrt(933).at n=7A042804
• Consider the Diophantine equation x^3 + y^3 = z^3 - 1 (x < y < z) or 'Fermat near misses'. Arrange solutions by increasing values of z. Sequence gives values of x.at n=39A050788
• a(n) = number of polynomials a_k*x^k + ... + a_1*x + a_0 with k > 0, integer coefficients, only distinct integer roots, and a_0 = p^n (p is a prime).at n=24A248348
• G.f. A(x) satisfies A(x) = 1/((1 - x*A(x)^3) * (1 - x*A(x))).at n=6A379189