979776

Appears in sequences

• Triangle whose (i,j)-th entry is binomial(i,j)*3^(i-j)*6^j.at n=34A038224
• Triangle whose (i,j)-th entry is binomial(i,j)*6^(i-j)*3^j.at n=29A038257
• Numbers k such that, in the prime factorization of k, the product of exponents equals the product of prime factors.at n=33A054412
• Number of periodic palindromes using a maximum of six different symbols.at n=13A056488
• a(1) = 1; then distinct numbers such that both the product of two successive terms + 1 and the ratio of the larger to the smaller of two successive terms + 1 is a prime.at n=24A084039
• Triangle, read by rows, of Stirling numbers of first kind, S1(n,k), multiplied by k^k, for n >= 1, 1<=k<=n.at n=26A105196
• Triangle, read by rows, of Stirling numbers of second kind, S2(n,k), multiplied by k^k, for n >= 1, 1<=k<=n.at n=26A105197
• a(n) = (n^(n+1))*(n + 1)/2 = A000217(n)*A000312(n).at n=6A109391
• a(n) = binomial(n+4, 4)*6^n.at n=5A139626
• Triangle T(n, k) = n!*StirlingS2(n, k)/binomial(n, k), read by rows.at n=40A156815
• a(n) = n^7*(n + 1)/2.at n=6A168635
• Numbers m for which Sum_{i=1..k} (1+1/p_i) + Product_{i=1..k} (1+1/p_i) is an integer, where p_i are the k prime factors of m (with multiplicity).at n=23A199767
• Composite numbers m such that Product_{i=1..k} (p_i/(p_i-1)) / Sum_{i=1..k} (p_i/(p_i+1)) is an integer, where p_i are the k prime factors of m (with multiplicity).at n=29A230112
• Numbers m such that sigma(Product(p_j)) = sigma(Product(e_j)), where m = Product((p_i)^e_i) and sigma = A000203.at n=43A272859
• Integers that can be written m = k*tau(k) = q*tau(q) where (k, q) is a primitive solution of this equation and tau(k) is the number of divisors of k.at n=23A338384
• Numbers k such that, in the prime factorization of k, the least common multiple of the exponents equals the least common multiple of the prime factors.at n=43A356433
• a(n) is the median of the set of the distinct values of (n-1)^n, (n-1)^(n+1), n^(n-1), n^(n+1), (n+1)^(n-1), (n+1)^n.at n=6A391414