32006

Appears in sequences

• Number of partitions of n into parts not of the form 23k, 23k+8 or 23k-8. Also number of partitions with at most 7 parts of size 1 and differences between parts at distance 10 are greater than 1.at n=40A035996
• Number of (n+1) X (1+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 6 (constant-stress 1 X 1 tilings).at n=6A235303
• Number of (n+1) X (7+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 6 (constant-stress 1 X 1 tilings).at n=0A235309
• T(n,k) is the number of (n+1) X (k+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 6 (constant-stress 1 X 1 tilings).at n=21A235310
• T(n,k) is the number of (n+1) X (k+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 6 (constant-stress 1 X 1 tilings).at n=27A235310
• Number of partitions of n such that the absolute value of the difference between the number of odd parts and the number of even parts is <=1.at n=49A239835
• Matula-Goebel numbers of unlabeled rooted identity RPMG-trees, meaning the Matula-Goebel numbers of the branches of any non-leaf node are relatively prime.at n=18A316469
• Matula-Goebel tree number of tree n with a new leaf added below each existing vertex.at n=32A348067