221184

Appears in sequences

• MU-numbers: next term is uniquely the product of 2 earlier terms.at n=39A007335
• Expansion of g.f. (1+2*x)/(1-2*x)^2.at n=13A014480
• Numbers of form 4^i*6^j, with i, j >= 0.at n=38A025618
• Orders of finite Abelian groups having the incrementally largest numbers of nonisomorphic forms (A046054).at n=17A046055
• Positive numbers n such that n is a multiple of (product of digits of n) * (sum of digits of n).at n=30A049102
• Sum of divisors of those numbers n such that n and n+1 have the same sum of divisors.at n=29A053215
• a(n) = Product_{k=1..n} d(k); d(k) = A000005(k) is the number of positive divisors of k.at n=13A066843
• 16-almost primes (generalization of semiprimes).at n=4A069277
• Table T(n,k) giving number of spanning trees in complete bipartite graph K(n,k), read by antidiagonals.at n=41A072590
• Table T(n,k) giving number of spanning trees in complete bipartite graph K(n,k), read by antidiagonals.at n=39A072590
• a(n) = 2^(n-3)*(n^2+3*n+8).at n=13A072863
• Expansion of 2*x*(1+4*x+8*x^2)/(1-24*x^3).at n=11A076508
• Increasing gaps between 3-smooth numbers (lower end).at n=38A084789
• Number of divisors of n-th cyclic number.at n=12A087024
• a(n) = 2^n*(n!)^3.at n=4A088386
• Inverse binomial transform of n*Pell(n).at n=27A093968
• 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=11A094590
• Analog of A095236 when the phones are arranged in a circle.at n=11A095239
• Hankel transform of sequence (b(n)) where b(n) = Sum_{i=0..n} binomial(2*i,i).at n=14A098106
• a(1) = 1, a(2) = (2*1)/1 = 2. a(n+1) = (n+1)*a(n) divided by the largest prime divisor of a(n).at n=17A100773