64320

Appears in sequences

• Number of partitions of n into parts not of the form 23k, 23k+9 or 23k-9. Also number of partitions with at most 8 parts of size 1 and differences between parts at distance 10 are greater than 1.at n=44A035997
• Number of conjugacy classes in the group GL(3,Z_n).at n=39A086768
• Number of (n+1) X (2+1) 0..7 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 8 (constant-stress 1 X 1 tilings).at n=4A234732
• Number of (n+1) X (5+1) 0..7 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 8 (constant-stress 1 X 1 tilings).at n=1A234735
• T(n,k) is the number of (n+1) X (k+1) 0..7 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 8 (constant-stress 1 X 1 tilings).at n=16A234738
• T(n,k) is the number of (n+1) X (k+1) 0..7 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 8 (constant-stress 1 X 1 tilings).at n=19A234738
• 10-step Fibonacci sequence starting with 0,0,0,0,0,1,0,0,0,0.at n=26A251762
• Numbers whose decimal and hexadecimal representations both have strictly decreasing digits.at n=26A260096
• a(n) = A273059(4n+2).at n=44A275918
• Number of n X 2 0..1 arrays with each 1 adjacent to 1, 3 or 5 king-move neighboring 1s.at n=11A296946
• a(n) is the least k that is a multiple of A071395(n) (the n-th primitive abundant number) for which A003961(k) is abundant.at n=44A337469