89935
domain: N
Appears in sequences
- a(n) = Sum_{1 <= x, y <= n} lcm(x, y).at n=25A064951
- Number of ways to choose an integer partition of each factor in a factorization of n.at n=44A318948
- T(n,k) = coefficient of x^n*y^k in A(x,y) such that: x = Sum_{n=-oo..+oo} (-1)^n * x^n * (y + x^n)^n * A(x,y)^n.at n=53A359720
- a(n) = A359720(n+2,1), for n >= 0.at n=10A359725