54450

Appears in sequences

• Product of n with sum of next n consecutive integers.at n=32A036659
• Triangle T(n,m)=m*n*binomial(m+n,m)^2/(2*(m+n)) read by rows.at n=38A131635
• Non-deficient numbers with odd sigma such that the sum of the even divisors is twice the sum of the odd divisors.at n=30A171642
• Triangle read by rows: T(n,k) = number of arrangements of n indistinguishable balls in n boxes with the maximum number of balls in any box equal to k.at n=59A180281
• Number of arrangements of n indistinguishable balls in n boxes with the maximum number of balls in any box equal to 5.at n=6A180285
• Number of arrangements of n indistinguishable balls in n boxes with the maximum number of balls in any box equal to n-6.at n=4A180296
• Numbers with prime factorization pq^2r^2s^2.at n=31A189344
• Number of bases to which terms of A141768 are strong pseudoprimes.at n=22A195328
• Number of (n+1) X 4 0..2 arrays with every 2 X 3 or 3 X 2 subblock having exactly three counterclockwise and three clockwise edge increases.at n=3A206145
• Number of (n+1) X 5 0..2 arrays with every 2 X 3 or 3 X 2 subblock having exactly three counterclockwise and three clockwise edge increases.at n=2A206146
• T(n,k) = number of (n+1) X (k+1) 0..2 arrays with every 2 X 3 or 3 X 2 subblock having exactly three counterclockwise and three clockwise edge increases.at n=17A206150
• T(n,k) = number of (n+1) X (k+1) 0..2 arrays with every 2 X 3 or 3 X 2 subblock having exactly three counterclockwise and three clockwise edge increases.at n=18A206150
• Number of nX4 1..3 arrays with no element with value z exactly a city block distance of z from another element with value z.at n=6A209370
• Number of nX7 1..3 arrays with no element with value z exactly a city block distance of z from another element with value z.at n=3A209373
• T(n,k) = Number of n X k 1..3 arrays with no element with value z exactly a city block distance of z from another element with value z.at n=48A209374
• Triangle t(n,r) = s(n,r)*s(n,r+1), where s(n,r) = lcm(n,n-1,...,n-r+1)/lcm(1,2,...,r-1,r), n >= 1 and 0 <= r < n.at n=58A241475
• 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 1,2 or 1,0.at n=28A264003
• 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=7A264004
• 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=28A264207
• a(n) = Product_{d|n} psi(d), where psi(m) is the sum of totatives of m (A023896).at n=32A280246