99484

Appears in sequences

• a(n) = LCM(binomial(n,0), ..., binomial(n,n)) / binomial(n,floor(n/2)).at n=44A048619
• Numbers k such that usigma(k) = phi(k)*omega(k), where omega(k) is the number of distinct prime divisors of k.at n=27A063795
• Numbers k such that phi(k) = sigma(core(k)) where phi(k) is the Euler totient function, sigma(k) the sum of divisors of k and core(k) the squarefree part of k (the smallest integer such that k*core(k) is a square).at n=12A069552
• Numbers n such that sigma(n) = 7*phi(n).at n=15A136540
• a(n) = lcm{1,2,...,n} / swinging_factorial(n) = A003418(n) / A056040(n).at n=45A180000
• a(n) = Product_{k=1..n} A002720(k).at n=4A365269
• Table in which the g.f. of row n, R(n,x), satisfies Sum_{k=-oo..+oo} (-1)^k * (x^k + n*R(n,x))^k = 1 + (n+2)*Sum_{k>=1} (-1)^k * x^(k^2), for n >= 1, as read by antidiagonals.at n=63A370020
• Expansion of g.f. A(x) satisfying Sum_{n=-oo..+oo} (-1)^n * (x^n + 3*A(x))^n = 1 + 5*Sum_{n>=1} (-1)^n * x^(n^2).at n=8A370023
• Numbers k such that sigma(k) = psi(k) + phi(k).at n=20A389478