337920

Appears in sequences

• Greatest number in row n of array T given by A027144.at n=14A027155
• Triangular array T(n,k) giving number of weakly connected digraphs with n labeled nodes and k arcs (n >= 1, 0 <= k <= n(n-1)).at n=51A062735
• Let A(n) = {1,2,3,...n}. Let B(r) and C(n-r) be two subsets of A(n) having r and n-r elements respectively, such that B(r) U C(n-r) = A(n) and B and C are disjoint; then a(n) = sum of the products of all combination sums of elements of B and C for r =1 to n-1.at n=9A067057
• Duplicate of A067057.at n=9A084399
• Number of closed walks on C_5 tensor J_2.at n=11A101502
• Number of permutations of floor(i*5/4), i=0..n-1, with all sums of 7 adjacent terms unique.at n=8A152633
• a(n) = n! * [x^n] 2*(tan(x))^2*(sec(x) + tan(x)).at n=9A164575
• Denominators of expansion of (Sum_{k=1..n} 1/k) - log(n(1+1/(2n))) - gamma.at n=8A189049
• 1-quantum transitions in systems of N spin 1/2 particles, in columns by combination indices. Triangle read by rows, T(n, k) for n >= 1 and 0 <= k <= floor((n-1)/2).at n=37A213343
• Triangle read by rows, k!*S_4(n, k) where S_m(n, k) are the Stirling-Frobenius subset numbers of order m; n >= 0, k >= 0.at n=19A225473
• Number of 6-cycles in the n-folded cube graph.at n=9A301459
• Number of (undirected) Hamiltonian paths in the 2n-crossed prism graph.at n=8A308136
• Number of subsets of {1..n} that contain exactly three odd numbers.at n=21A331408
• a(n) is the number of subsets of {1..n} that contain exactly 4 odd numbers.at n=20A331419