3538944

Appears in sequences

• Orders of finite Abelian groups having the incrementally largest numbers of nonisomorphic forms (A046054).at n=30A046055
• Number of divisors of k as k runs through sequence of distinct values of LCM(1,..,n).at n=26A056795
• a(n) = Product_{k=1..n} d(k); d(k) = A000005(k) is the number of positive divisors of k.at n=15A066843
• 20-almost primes (generalization of semiprimes).at n=4A069281
• a(n) is the number of occurrences of 7's in the palindromic compositions of 2*n-1, or also, the number of occurrences of 8's in the palindromic compositions of 2*n.at n=17A079861
• a(n) = 4^(n-2)*n*(5*n+3)/2.at n=9A084901
• Product of three solutions of the Diophantine equation x^2 - y^2 = z^3.at n=3A085482
• Number of divisors of n-th cyclic number.at n=9A087024
• Number of divisors of n-th cyclic number.at n=17A087024
• a(1) = 1; a(n+1) = a(n) * k(n), where k(n) is the number of elements of {a(j)}, 1<=j<=n, which are <= n.at n=13A094590
• Numbers n such that (phi(n) + sigma(n))/(rad(n))^2 is an integer > 1 (phi=A000010, sigma=A000203, rad=A007947).at n=19A097982
• Smallest number beginning with 3 and having exactly n prime divisors counted with multiplicity.at n=19A106423
• Numbers k such that (phi(k) + sigma(k))/rad(k)^2 is an integer, that is (phi(k) + sigma(k)) is divisible by every prime factor of k squared.at n=21A121850
• a(n) = floor(2^(n-2)*3*n).at n=17A128543
• 3n(n-1)4^(n-2).at n=9A129532
• a(n) = 27*2^n.at n=17A175806
• Product of digits of all the divisors of n.at n=47A190997
• Number of n X 2 0..2 arrays with new values 0..2 introduced in row major order and no element equal to any knight-move neighbor (colorings ignoring permutations of colors).at n=10A208428
• For n > 2 , a(n) = a(n-2) + lcm(a(n-2), n-1) with a(1)=2, a(2)=2.at n=22A217662
• Number of defective 3-colorings of an n X 2 0..2 array connected diagonally and antidiagonally with exactly one mistake, and colors introduced in row-major 0..2 order.at n=9A229504