39337984

Appears in sequences

• a(n) = n^4 * 4^n.at n=7A062075
• a(n) = (2n-1)^n * n^(2n-1).at n=3A062076
• a(n) = prime(n)^n * n^prime(n).at n=3A062082
• a(n) = A001142(n)/A002944(n), i.e., the product of C(n,j) binomial coefficients (for j=0..n) is divided by the least common multiple of them.at n=7A092592
• a(n) = n^7 * 7^n.at n=4A098803
• Numbers of the form j^k * k^j, where j,k > 1.at n=27A146748
• Number of nX2 0..2 arrays with every element neighboring horizontally or vertically both a 0 and a 1.at n=15A203536
• a(n) = A215723(n) / 2^(n-1).at n=20A215897
• Number of (n+1)X(1+1) 0..2 arrays with the maximum plus the upper median plus the lower median plus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=10A237368
• Number of (1+1) X (n+1) arrays of permutations of 0..n*2+1 with each element having index change (+-,+-) 0,0 1,2 or 1,0.at n=12A264004
• Number of (n+1) X (3+1) arrays of permutations of 0..n*4+3 with each element having index change +-(.,.) 0,0 0,2 or 1,0.at n=5A264203
• T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having index change +-(.,.) 0,0 0,2 or 1,0.at n=33A264207
• Triangle, read by rows: n^k * k^n, for n >= 1 and k = 1..n.at n=24A303990
• Row product of A374433.at n=28A374431