64669

Appears in sequences

• Triangle read by rows: T(n,k) = number of graphs on n node with edge chromatic number k (n >= 1, k >= 1).at n=46A123962
• a(n) is the sum of the smallest parts of all partitions of n that do not contain 1 as a part.at n=48A182708
• Number of 0..2 arrays of length n+3 with sum less than 4 in any length 4 subsequence (=less than 50% duty cycle).at n=10A212723
• Number of (n+2)X3 0..1 arrays with all rows having a nonnegative second derivative, and all and columns having a positive second derivative in a quadratic least squares fit, with one and two element arrays taken as having a zero second derivative.at n=5A223647
• T(n,k)=Number of (n+2)Xk 0..1 arrays with all rows having a nonnegative second derivative, and all and columns having a positive second derivative in a quadratic least squares fit, with one and two element arrays taken as having a zero second derivative.at n=33A223652
• Partial sums of A092181.at n=9A302562
• Semiprimes with only semiprime digits, each appearing at least once.at n=29A349275
• Place n equally spaced points on each side of a square, and join each of these points by a chord to the 3*n new points on the other three sides: sequence gives number of vertices in the resulting planar graph.at n=10A367276