216000000

Appears in sequences

• a(n) = (n*(n+1))^3.at n=24A060459
• Cubes from which deleting a suitable digit leaves a square.at n=22A074102
• Cubes that may be transformed into squares by prefixing with a single nonzero digit.at n=5A167127
• Number of nX3 binary arrays without the pattern 0 0 1 1 diagonally, vertically or horizontally.at n=9A189155
• Number of (n+2)X(1+2) 0..2 arrays with nondecreasing sum of every three consecutive values in every row and column.at n=5A250594
• Number of (n+2)X(6+2) 0..2 arrays with nondecreasing sum of every three consecutive values in every row and column.at n=0A250599
• T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with nondecreasing sum of every three consecutive values in every row and column.at n=15A250601
• T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with nondecreasing sum of every three consecutive values in every row and column.at n=20A250601
• Number of (n+2)X(6+2) 0..1 arrays with nondecreasing sum of every three consecutive values in every row and column.at n=3A251191
• Cubes of the form prime(n)+n.at n=28A272245
• Irregular triangular array, read by rows: T(n,k) is the sum of the products of multinomial coefficients (n_1 + n_2 + n_3 + ...)!/(n_1! * n_2! * n_3! * ...) taken k at a time, where (n_1, n_2, n_3, ...) runs over all integer partitions of n (n >= 0, 0 <= k <= A000041(n)).at n=24A309951
• Product of multinomial coefficients M(n;lambda), where lambda ranges over all partitions of n.at n=5A309972
• a(n) = (n*n!)^3.at n=4A321207
• Irregular triangular array, read by rows: T(n,k) is the sum of the products of distinct multinomial coefficients (n_1 + n_2 + n_3 + ...)!/(n_1! * n_2! * n_3! * ...) taken k at a time, where (n_1, n_2, n_3, ...) runs over all integer partitions of n (n >= 0, 0 <= k <= A070289(n)).at n=24A325305
• Terms of A342456 prime-shifted so far towards lower primes that they become even: a(n) = 2*A246277(A342456(n)).at n=44A342457
• Number of minimal edge coverings of the n-triangular honeycomb acute knight graph.at n=7A351591