25765
domain: N
Appears in sequences
- Multiplicity of highest weight (or singular) vectors associated with character chi_12 of Monster module.at n=44A034400
- 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=26A050788
- Third row of Pascal-(1,5,1) array A081580.at n=38A081589
- G.f.: A(x) = exp( Sum_{n>=1} A005260(n)*x^n/(2*n) ), where A005260(n) = Sum_{k=0..n} C(n,k)^4.at n=6A166993