Sequences
392,541 sequences
- Number of n-dimensional odd unimodular lattices (or quadratic forms).A054911
Number of n-dimensional odd unimodular lattices (or quadratic forms).
- Expansion of e.g.f.: sqrt(exp(5*x)/(2-exp(x))).A054912
Expansion of e.g.f.: sqrt(exp(5*x)/(2-exp(x))).
- Number of labeled connected graphs with n nodes such that complement is also connected.A054913
Number of labeled connected graphs with n nodes such that complement is also connected.
- Number of labeled connected digraphs with n nodes such that complement is also connected.A054914
Number of labeled connected digraphs with n nodes such that complement is also connected.
- Number of unlabeled connected graphs with n nodes such that complement is also connected.A054915
Number of unlabeled connected graphs with n nodes such that complement is also connected.
- Number of connected unlabeled regular graphs with n nodes such that complement is also connected.A054916
Number of connected unlabeled regular graphs with n nodes such that complement is also connected.
- Number of connected unlabeled vertex-transitive graphs with n nodes such that complement is also connected.A054917
Number of connected unlabeled vertex-transitive graphs with n nodes such that complement is also connected.
- Number of connected unlabeled digraphs with n nodes such that complement is also connected.A054918
Number of connected unlabeled digraphs with n nodes such that complement is also connected.
- Number of nonisomorphic connected unlabeled binary relations on n nodes.A054919
Number of nonisomorphic connected unlabeled binary relations on n nodes.
- Number of connected unlabeled reflexive relations with n nodes such that complement is also connected.A054920
Number of connected unlabeled reflexive relations with n nodes such that complement is also connected.
- Number of connected unlabeled symmetric relations (graphs with loops) having n nodes.A054921
Number of connected unlabeled symmetric relations (graphs with loops) having n nodes.
- Number of connected unlabeled symmetric relations (graphs with loops) having n nodes such that complement is also connected.A054922
Number of connected unlabeled symmetric relations (graphs with loops) having n nodes such that complement is also connected.
- Triangle read by rows: number of connected graphs with k >= 0 edges and n nodes (1<=n<=k+1).A054923
Triangle read by rows: number of connected graphs with k >= 0 edges and n nodes (1<=n<=k+1).
- Triangle read by rows: T(n,k) = number of nonisomorphic unlabeled connected graphs with n nodes and k edges (n >= 1, 0 <= k <= n(n-1)/2).A054924
Triangle read by rows: T(n,k) = number of nonisomorphic unlabeled connected graphs with n nodes and k edges (n >= 1, 0 <= k <= n(n-1)/2).
- a(n) = ceiling(n*(n-1)/4).A054925
a(n) = ceiling(n*(n-1)/4).
- Number of connected unlabeled graphs with n nodes and floor(n*(n-1)/4) edges.A054926
Number of connected unlabeled graphs with n nodes and floor(n*(n-1)/4) edges.
- Number of connected unlabeled graphs having n nodes and ceiling(n(n-1)/4) edges such that the complement is also connected.A054927
Number of connected unlabeled graphs having n nodes and ceiling(n(n-1)/4) edges such that the complement is also connected.
- Number of complementary pairs of directed graphs on n nodes. Also number of unlabeled digraphs with n nodes and an even number of arcs.A054928
Number of complementary pairs of directed graphs on n nodes. Also number of unlabeled digraphs with n nodes and an even number of arcs.
- Number of complementary pairs of circulant graphs on n nodes.A054929
Number of complementary pairs of circulant graphs on n nodes.
- Number of complementary pairs of circulant digraphs on n nodes.A054930
Number of complementary pairs of circulant digraphs on n nodes.
- Number of unlabeled connected graphs up to complementarity.A054931
Number of unlabeled connected graphs up to complementarity.
- Number of unlabeled connected digraphs up to complementarity.A054932
Number of unlabeled connected digraphs up to complementarity.
- Number of unlabeled digraphs on n nodes up to reversing the arcs.A054933
Number of unlabeled digraphs on n nodes up to reversing the arcs.
- Number of oriented graphs on n nodes up to reversing the arcs.A054934
Number of oriented graphs on n nodes up to reversing the arcs.
- Number of planar maps with n edges up to orientation-preserving duality.A054935
Number of planar maps with n edges up to orientation-preserving duality.
- Duplicate of A006443.A054936
Duplicate of A006443.
- Number of chiral pairs of planar maps with n edges.A054937
Number of chiral pairs of planar maps with n edges.
- Number of chiral chord diagrams on n nodes.A054938
Number of chiral chord diagrams on n nodes.
- Number of connected labeled graphs with n nodes and an even number of edges.A054939
Number of connected labeled graphs with n nodes and an even number of edges.
- Number of connected labeled graphs with n nodes and an odd number of edges.A054940
Number of connected labeled graphs with n nodes and an odd number of edges.
- Number of weakly connected oriented graphs on n labeled nodes.A054941
Number of weakly connected oriented graphs on n labeled nodes.
- Number of connected oriented graphs on n nodes with an even number of edges.A054942
Number of connected oriented graphs on n nodes with an even number of edges.
- Number of connected oriented graphs on n nodes with an odd number of edges.A054943
Number of connected oriented graphs on n nodes with an odd number of edges.
- Number of strongly connected labeled digraphs on n nodes with an even number of edges.A054944
Number of strongly connected labeled digraphs on n nodes with an even number of edges.
- Number of strongly connected labeled digraphs on n nodes with an odd number of edges.A054945
Number of strongly connected labeled digraphs on n nodes with an odd number of edges.
- Number of strongly connected labeled tournaments on n nodes.A054946
Number of strongly connected labeled tournaments on n nodes.
- Enumerates pairs consisting of a strongly connected labeled tournament and an arbitrary labeled tournament.A054947
Enumerates pairs consisting of a strongly connected labeled tournament and an arbitrary labeled tournament.
- Number of labeled semi-strong digraphs on n nodes.A054948
Number of labeled semi-strong digraphs on n nodes.
- Number of labeled semi-strong digraphs on n nodes with an odd number of components.A054949
Number of labeled semi-strong digraphs on n nodes with an odd number of components.
- Number of labeled semi-strong digraphs on n nodes with an even number of components.A054950
Number of labeled semi-strong digraphs on n nodes with an even number of components.
- Number of unlabeled semi-strong digraphs on n nodes with mutually nonisomorphic components.A054951
Number of unlabeled semi-strong digraphs on n nodes with mutually nonisomorphic components.
- Number of unlabeled semi-strong digraphs on n nodes with pairwise different components.A054952
Number of unlabeled semi-strong digraphs on n nodes with pairwise different components.
- Number of unlabeled semi-strong digraphs on n nodes with an odd number of pairwise different components.A054953
Number of unlabeled semi-strong digraphs on n nodes with an odd number of pairwise different components.
- Number of unlabeled semi-strong digraphs on n nodes with an even number of pairwise different components.A054954
Number of unlabeled semi-strong digraphs on n nodes with an even number of pairwise different components.
- Number of labeled Eulerian digraphs with n nodes and an even number of edges.A054955
Number of labeled Eulerian digraphs with n nodes and an even number of edges.
- Number of labeled Eulerian digraphs with n nodes and an odd number of edges.A054956
Number of labeled Eulerian digraphs with n nodes and an odd number of edges.
- Number of labeled connected Eulerian digraphs with n nodes.A054957
Number of labeled connected Eulerian digraphs with n nodes.
- Number of labeled connected Eulerian digraphs with n nodes and an even number of edges.A054958
Number of labeled connected Eulerian digraphs with n nodes and an even number of edges.
- Number of labeled connected Eulerian digraphs with n nodes and an odd number of edges.A054959
Number of labeled connected Eulerian digraphs with n nodes and an odd number of edges.
- Number of unlabeled graphs with n nodes and an odd number of edges.A054960
Number of unlabeled graphs with n nodes and an odd number of edges.