36192

Appears in sequences

• Number of asymmetric trees with n nodes (also called identity trees).at n=20A000220
• Shifts 2 places left under Dirichlet convolution.at n=32A144366
• Number of (n+1)X(1+1) 0..3 arrays colored with the maximum plus the upper median plus the minimum of every 2X2 subblock.at n=2A236296
• Number of (n+1)X(3+1) 0..3 arrays colored with the maximum plus the upper median plus the minimum of every 2X2 subblock.at n=0A236298
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays colored with the maximum plus the upper median plus the minimum of every 2X2 subblock.at n=3A236299
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays colored with the maximum plus the upper median plus the minimum of every 2X2 subblock.at n=5A236299
• a(n) = 27*n^2 - 21*n + 6 (n>=1).at n=36A304164
• a(n) = 4*(n - 1)*(16*n - 23) for n >= 1.at n=24A304378
• Triangle T(n,m) read by rows: Sum_{k=1..m} binomial(2*n, n+k)*d(k), m<=n, with d(k)=A000005(k).at n=30A351145
• a(n) is the number of multisets of n decimal digits where the sum of the digits equals the product of the prime digits.at n=29A384445