885600
domain: N
Appears in sequences
- Define the array k(n,x) = number of m such that tau(gcd(n,m)) is x where m runs from 1 to n. Also define h(n,x) = Sum_{d|n : tau(d) = x} d. The sequence contains numbers n such that k(n,x)*x = h(n,x) has at least one solution x.at n=35A197099
- G.f. A(x) satisfies: Sum_{n>=0} A(x)^(n*(n+1)/2) * x^n = Sum_{n>=0} A(x)^((n+1)^2) * x^(2*n).at n=12A335625