26704

Appears in sequences

• Number of connected labeled graphs with n nodes.at n=6A001187
• Expansion of (1/theta_4 - 1)/2.at n=27A014968
• Numbers k such that 103*2^k+1 is prime.at n=16A032401
• a(n) = Sum_{k=0,1,2,...,n-4,n-2,n-1} a(k); a(n-3) is not a summand, with a(0)=a(1)=a(2)=1.at n=18A049864
• Number of connected labeled 6-colorable (i.e., chromatic number <= 6) graphs on n nodes.at n=5A084286
• Let M = the 3 X 3 matrix [1 1 1; 3 1 0; 2 0 0]. Perform M^n * [1 0 0] getting (1, 3, 2; 6, 6, 2; 14, 24, 12; 50, 66, 28; ...) which we string together to form the sequence.at n=29A107271
• Triangle read by rows: T(n,k) is the number of binary sequences of length n containing k subsequences 0110 (n,k >= 0).at n=46A118890
• Triangle read by rows: T(n,k) = number of labeled graphs on n nodes with k connected components, 1<=k<=n.at n=15A143543
• Number of 2nX2n 0..2 arrays with values 0..2 introduced in row major order and each element unequal to exactly two horizontal and vertical neighbors.at n=2A198446
• Number of 2nX6 0..2 arrays with values 0..2 introduced in row major order and each element unequal to exactly two horizontal and vertical neighbors.at n=2A198449
• T(n,k)=Number of 2nX2k 0..2 arrays with values 0..2 introduced in row major order and each element unequal to exactly two horizontal and vertical neighbors.at n=12A198452
• Number of permutations of n objects such that no four-element subset is preserved.at n=8A213323
• Triangular array read by rows. T(n,k) is the number of simple labeled graphs on n nodes with no isolated nodes and exactly k components. n >= 2, 1 <= k < n/2.at n=6A218334
• Triangular array read by rows: T(n,k) is the number of connected components with size k summed over all simple labeled graphs on n nodes; n>=1, 1<=k<=n.at n=20A223894
• Triangular array read by rows: T(n,k) is the number of simple labeled graphs on n vertices, n>=1, with exactly k connected components, 1<=k<=n, such that the vertices labeled with 1,2,...,k are all in different components.at n=15A275595
• Regular triangle where T(n,k) is the number of labeled connected k-uniform hypergraphs spanning n vertices.at n=16A299354
• Triangle read by rows, T(n, k) = 2^k*binomial(n, k)*hypergeom([-k, k - n, k - n], [1, -n], 1/2) for n >= 0 and 0 <= k <= n.at n=51A299444
• Square array A(n,k), n >= 1, k >= 1, read by antidiagonals, where column k is the expansion of e.g.f. log(Sum_{j>=0} k^binomial(j,2) * x^j/j!).at n=26A308460
• Sum of the second largest parts in the partitions of n into 5 parts.at n=48A308826
• Triangle read by rows: T(n,k) is the number of k-colored connected graphs on n labeled nodes up to permutation of the colors.at n=20A322278