39720

Appears in sequences

• a(n) = 1728*n - 24.at n=22A157287
• Triangle T_3(n, m), the number of surjective multi-valued functions from {1, 1, 1, 2, 3, ..., n-2} to {1, 2, 3, ..., m} by rows (n >= 1, 1 <= m <= n).at n=33A172107
• Number of n X 5 binary arrays with each 1 adjacent to exactly two other 1s.at n=8A183326
• Numbers n such that the n-th digit (after the decimal point) in the decimal expansion of Pi are the occurrence of the least significant digit represented by the more significant digits.at n=29A201545
• Antidiagonal sums of the convolution array A213828.at n=14A213830
• Number of (n+1) X (1+1) 0..4 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 2, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=6A234914
• Number of (n+1) X (7+1) 0..4 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 2, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=0A234920
• T(n,k) is the number of (n+1) X (k+1) 0..4 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 2, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=21A234921
• T(n,k) is the number of (n+1) X (k+1) 0..4 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 2, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=27A234921
• Numbers n = p * q, where n, p, and q together contain all 10 digits at least once.at n=52A253172
• Number T(n,k) of rooted trees with n nodes and colored non-root nodes using exactly k colors; triangle T(n,k), n>=1, 0<=k<=n-1, read by rows.at n=25A256064
• Number of permutations of [n] that avoid the shuffle pattern s-k-t, where s = 132 and t = 132.at n=8A324139