8847360

Appears in sequences

• Product of totient function: a(n) = Product_{k=1..n} phi(k) (cf. A000010).at n=13A001088
• Triangle whose (i,j)-th entry is binomial(i,j)*8^(i-j)*12^j.at n=23A038290
• Triangle whose (i,j)-th entry is binomial(i,j)*12^(i-j)*8^j.at n=25A038334
• 20-almost primes (generalization of semiprimes).at n=16A069281
• Number of plane binary trees of size n+3 and contracted height n.at n=16A074092
• Determinant of the n X n matrix M_(i,j)=i/gcd(i,j)=lcm(i,j)/j.at n=15A085542
• Product of the first n 5-almost primes (A014614).at n=3A122123
• G.f. satisfies: A(x) = exp( Sum_{n>=1} [Sum_{k=0..2*n} A200536(n,k)^2 * x^k] / A(x)^n * x^n/n ), where A200536(n,k) is the coefficient of x^k in (1+3*x+2*x^2)^n.at n=32A200537
• Numbers m such that, in the prime factorization of m, the product of the prime factors equals the sum of prime factors and exponents.at n=30A231293
• Product_{i=1..n} A173557(i).at n=14A239682
• Product_{i=1..n} A173557(i).at n=15A239682
• Triangle read by rows: coefficients T(n,k) of a binomial decomposition of n^n as Sum(k=0..n)T(n,k)*binomial(n,k).at n=59A244120
• a(0) = 1; a(n+1) is the smallest number not in the sequence such that a(n+1) - Sum_{i=1..n} a(i) divides a(n+1) + Sum_{i=1..n} a(i).at n=43A250305
• G.f. satisfies: A(x) = exp( Sum_{n>=1} [Sum_{k=0..2*n} A200536(n,2*n-k)^2 * x^k] / A(x)^n * x^n/n ), where A200536(n,2*n-k) is the coefficient of x^k in (2+3*x+x^2)^n.at n=32A251689
• Heinz numbers of integer partitions, with at least three parts, whose product of parts is one fewer than their sum.at n=34A325043
• a(n) = A163176(n+1)*A003557(n+1).at n=17A341108
• Integers k such that A008472(k) / A001222(k) = 1/2.at n=21A390139