53892
domain: N
Appears in sequences
- Numbers n such that a positive number m < n exists such that n-m, n+m, and n*m are oblong numbers (A002378).at n=8A224954
- Number of (m1,m2,n1,n2) in {0,1,...,n}^4 such that gcd(X^m1 + (1+X)^n1, X^m2 + (1+X)^n2) = 1 over GF(2).at n=14A245488
- Triangle T(n,t) read by rows: number of rooted forests with n 2-colored nodes and t rooted trees.at n=48A271878
- a(n) is the smallest number which can be represented as the sum of n distinct nonzero n-gonal numbers in exactly n ways, or 0 if no such number exists.at n=20A350405
- E.g.f. satisfies A(x) = (1 - x * log(1 - x*A(x)))^3.at n=6A377686