57232

Appears in sequences

• A partition product of Stirling_1 type [parameter k = -4] with biggest-part statistic (triangle read by rows).at n=29A157384
• A partition product of Stirling_1 type [parameter k = 4] with biggest-part statistic (triangle read by rows).at n=29A157394
• A partition product of Stirling_2 type [parameter k = -4] with biggest-part statistic (triangle read by rows).at n=29A157398
• A partition product of Stirling_2 type [parameter k = 4] with biggest-part statistic (triangle read by rows).at n=29A157404
• a(n) = 73*n^2.at n=28A174334
• Number of (n+1) X (n+1) 0..2 arrays containing all values 0..2 with every 2 X 2 subblock having one or two distinct values, and new values 0..2 introduced in row major order.at n=2A210087
• Number of (n+1)X4 0..2 arrays containing all values 0..2 with every 2X2 subblock having one or two distinct values, and new values 0..2 introduced in row major order.at n=2A210090
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays containing all values 0..2 with every 2X2 subblock having one or two distinct values, and new values 0..2 introduced in row major order.at n=12A210095
• Number of factorizations of m^n into n factors, where m is a product of exactly 4 distinct primes and each factor is a product of 4 primes (counted with multiplicity).at n=7A257114
• Number A(n,k) of factorizations of m^n into n factors, where m is a product of exactly k distinct primes and each factor is a product of k primes (counted with multiplicity); square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=73A257462
• Starting with 1,2,3,4,5,6: a(n) is the next smallest number greater than a(n-1) such that a[i] + a[j] + a[k] != a[x] + a[y] + a[z] for 1 <= i,j,k,x,y,z <= n all distinct.at n=33A317778
• a(n) = sigma_1(n) * sigma_3(n).at n=11A379813