25598

Appears in sequences

• Number of connected bipartite graphs with n nodes.at n=11A005142
• T(2n,n+1), T given by A026769.at n=7A026883
• Number of ways to partition n elements into pie slices of different sizes other than one.at n=41A032155
• Triangle read by rows: T(n,k) is the number of simple connected graphs on n unlabeled nodes having chromatic number k, 1 <= k <= n.at n=56A084269
• Numbers n such that P+n is not irreducible, where P = x^8 - 8*x^6 + 20*x^4 - 16*x^2 + 2.at n=9A136362
• Numbers k such that 12*10^k + 1 is prime.at n=5A294396
• Number of integer partitions of n whose run-sums are not weakly decreasing.at n=39A357878
• Triangle read by rows: T(n,k) is the number of uniquely colorable simple graphs on n nodes with chromatic number k = 1..n.at n=56A369227