387072

Appears in sequences

• Place n distinguishable balls in n boxes (in n^n ways); let T(n,k) = number of ways that the maximum in any box is k, for 1 <= k <= n; sequence gives triangle of numbers T(n,k).at n=41A019575
• Triangle whose (i,j)-th entry is binomial(i,j)*2^(i-j)*6^j.at n=39A038212
• a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2, and a(3) = 3.at n=18A049957
• Number of subsets of {2,...,n} such that the product of their elements is congruent to 0 (mod n+1).at n=18A064381
• 15-almost primes (generalization of semiprimes).at n=24A069276
• Expansion of 1/((1-x)*(1+x+2*x^2-2*x^3)).at n=25A077910
• Numbers of divisors associated with the entries of A120585.at n=21A120586
• Composite numbers such that the cube root of the sum of cubes of their prime factors is an integer.at n=12A134608
• Numbers such that the cube root of the sum of cubes of their prime factors is a nonprime integer.at n=10A134609
• Total number of triangles in Cayley graph Cay(Z_{2^n}, QR*(2^n)).at n=6A206278
• Numbers that divide the product of the nonzero digits (in base 10) of their square.at n=41A218013
• Fixed points of A225546.at n=45A225547
• Integer areas of orthic triangles of integer-sided triangles.at n=23A230402
• a(n) = Sum_{0 < x,y,z,t <= n and gcd(x^2 + y^2 + z^2 + t^2, n)=1} gcd(x^2 + y^2 + z^2 + t^2 - 1, n).at n=20A239613
• Triangle T(n,k), n>=3, 3<=k<=n, read by rows. Number of ways to make n selections without replacement from a circular array of n unlabeled cells (ignoring rotations and reflection), such that the first selection of a cell adjacent to previously selected cells occurs on the k-th selection.at n=41A249796
• E.g.f.: Limit_{N->oo} [ Sum_{n>=0} (N + n*y)^(2*n) * (x/N)^n/n! ]^(1/N).at n=48A266488
• Numbers m such that Product(1 + p_i) = Product(1 + e_i), where m = Product((p_i)^e_i).at n=38A272858
• Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 355", based on the 5-celled von Neumann neighborhood.at n=18A281307
• Numbers n such that lcm(sigma(n), n) = tau(n) * sigma(n) where sigma(k) = the sum of the divisors of k (A000203) and tau(k) = the number of divisors of k (A000005).at n=8A306655
• Numbers that reach 1 under the iterations of the map k -> k/d(k) if d(k) | k, and k -> k otherwise, where d(k) is the number of divisors of k (A000005).at n=13A330816