540672

Appears in sequences

• Place n distinguishable balls in n boxes (in n^n ways); let f(n,k) = number of ways that max in any box is k, for 1 <= k <= n; sequence gives f(n,n-2)/n.at n=30A019579
• a(n) = n*(n - 1)^3/2.at n=33A019582
• Apart from the leading term, a(n) = Catalan(n-1)*4^(n-1).at n=7A052704
• Expansion of (1 + x - 2*x^2)/(1 - 2*x)^2.at n=15A052951
• 16-almost primes (generalization of semiprimes).at n=15A069277
• a(n) = n-th n-almost prime.at n=15A101695
• Records in A007374.at n=27A105207
• a(n) = n*(n-1)*2^n.at n=12A128796
• Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0), ending on the vertical axis and consisting of 2*n steps taken from {(-1, 0), (-1, 1), (1, 0), (1, 1)}.at n=6A151403
• a(0) = 9, a(n) = 2*a(n-1) + 2^(n-1) for n > 0.at n=15A159697
• Number of (n+1) X (1+1) 0..3 arrays with every 2 X 2 subblock having the sum of the absolute values of all six edge and diagonal differences equal to 9.at n=10A234133
• a(n) = 2^n*n!/((floor(n/2)+1)*floor(n/2)!^2).at n=12A240558
• Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 838", based on the 5-celled von Neumann neighborhood.at n=19A290547
• Square array A(n,k), n>=0, k>=0, read by antidiagonals, where column k is the expansion of 2/(1 + sqrt(1 - 4*k*x)).at n=61A290605
• T(n, k) = (n + 1)*2^(n + k)*hypergeom([-n, k - n + 1], [2], 1/2), triangle read by rows for 0 <= k <= n.at n=41A337617
• a(n) is the least k such that A161606(k) = n or a(n) = -1 if no such k exists.at n=16A385677
• Smallest integer k whose sum of its distinct prime factors and bigomega(k) both equal n; or -1 if no such integer exists.at n=14A386605