282528

Appears in sequences

• Number of strongly connected labeled digraphs on n nodes with an odd number of edges.at n=4A054945
• Number of permutations of floor(i*7/3), i=0..n-1, with all sums of 5 adjacent terms unique.at n=8A152358
• Number of 4-turn rook's tours on an n X n board summed over all starting positions.at n=8A187191
• Triangular array read by rows. T(n,k) is the number of square lattice walks that start and end at the origin after 2n steps having k primitive loops; n>=1, 1<=k<=n.at n=16A227997