308700

Appears in sequences

• Numbers n such that n | Sigma_2(n) + Phi(n)^2.at n=13A055696
• Numbers k such that n | sigma_10(k) + phi(k)^10.at n=28A055704
• Goedel encoding of the prime factors of n, in increasing order and repeated according to multiplicity.at n=23A074736
• Sum of all matrix elements of n X n matrix M(i,j) = i^3+j^3, (i,j = 1..n). a(n) = n^3*(n+1)^2/2.at n=13A099903
• Triangle of denominators of the cube of a certain lower triangular matrix.at n=25A119932
• Triangle T(n, k) = (-1)^n*StirlingS1(n, k)*StirlingS1(n, n-k), read by rows.at n=30A155742
• Triangle T(n, k) = (-1)^n*StirlingS1(n, k)*StirlingS1(n, n-k), read by rows.at n=33A155742
• Triangle T(n, k) = (-1)^n*StirlingS1(n, j)*StirlingS1(n, n-j), with T(n, 0) = T(n, n) = 1, read by rows.at n=30A155868
• Triangle T(n, k) = (-1)^n*StirlingS1(n, j)*StirlingS1(n, n-j), with T(n, 0) = T(n, n) = 1, read by rows.at n=33A155868
• A partition product of Stirling_2 type [parameter k = -5] with biggest-part statistic (triangle read by rows).at n=23A157397
• Number of reduced words of length n in Coxeter group on 7 generators S_i with relations (S_i)^2 = (S_i S_j)^4 = I.at n=7A162941
• Triangle a(n,k) = binomial(n,k)*binomial(n+1,k+1)*binomial(n+2,k+2) read by rows.at n=31A187552
• Numbers with prime factorization p^2*q^2*r^2*s^3 where p, q, r, and s are distinct primes.at n=5A190382
• Triangle of coefficients of polynomials p_n(x) (exponents in increasing order) where 2^(x-n-1)p_n(x)/n! counts the ways a game of Nim with two piles of sizes x and n can be played out (x > 0, n >= 0).at n=32A289329
• Numbers m such that the denominator of m/rho(m) is 3, where rho is A206369; i.e. A294649(m) = 3.at n=19A297358
• Numbers k such that A001414(k) and A001414(A004086(k)) are twin primes p, p+2.at n=8A337047
• Numbers having exactly four non-unitary prime factors.at n=13A338541
• Smallest powerful (1) number which is at the end of an arithmetic progression of n terms.at n=6A360883