48766

Appears in sequences

• Number of partitions of n with equal nonzero number of parts congruent to each of 1, 2 and 3 (mod 4).at n=68A046781
• Number of n-node planar graphs with minimum degree at least 3.at n=9A049371
• Triangle read by rows: T(n,k) (n>=1) gives the number of n-indecomposable polyominoes with k cells (k >= n).at n=58A125753
• Triangle read by rows: T(n,k) (n>=1) gives the number of n-indecomposable polyominoes with k cells (k >= 1).at n=58A125761
• Triangle read by rows: T(n,k) (n>=1) gives the number of n-indecomposable polyominoes with k cells (k >= 2n).at n=58A126743