Search: a003087 -id:a003087
|
| |
| |
|
|
|
1, 2, 4, 10, 41, 343, 6327, 249995, 20536020, 3445474030, 1169394086932, 798731069436512, 1094825607339329108, 3006942191342795594938, 16533858553282474307626008, 181924651566316766693192987410
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
| |
| |
|
|
| |
|
|
A003024
|
|
Number of acyclic digraphs (or DAGs) with n labeled nodes.
(Formerly M3113)
|
|
+10
71
|
|
|
|
1, 1, 3, 25, 543, 29281, 3781503, 1138779265, 783702329343, 1213442454842881, 4175098976430598143, 31603459396418917607425, 521939651343829405020504063, 18676600744432035186664816926721, 1439428141044398334941790719839535103, 237725265553410354992180218286376719253505
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
| |
| |
|
|
| |
|
|
A000595
|
|
Number of binary relations on n unlabeled points.
(Formerly M1980 N0784)
|
|
+10
45
|
|
|
|
1, 2, 10, 104, 3044, 291968, 96928992, 112282908928, 458297100061728, 6666621572153927936, 349390545493499839161856, 66603421985078180758538636288, 46557456482586989066031126651104256, 120168591267113007604119117625289606148096, 1152050155760474157553893461743236772303142428672
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
| |
| |
|
|
| |
|
|
A003025
|
|
Number of n-node labeled acyclic digraphs with 1 out-point.
(Formerly M2083)
|
|
+10
16
|
|
|
|
1, 2, 15, 316, 16885, 2174586, 654313415, 450179768312, 696979588034313, 2398044825254021110, 18151895792052235541515, 299782788128536523836784628, 10727139906233315197412684689421
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
| |
| |
|
|
| |
|
|
A122078
|
|
Triangle read by rows: T(n,k) is the number of unlabeled acyclic digraphs with n >= 0 nodes and n-k outnodes (0 <= k <= n).
|
|
+10
14
|
|
|
|
1, 1, 0, 1, 1, 0, 1, 2, 3, 0, 1, 3, 11, 16, 0, 1, 4, 25, 108, 164, 0, 1, 5, 47, 422, 2168, 3341, 0, 1, 6, 78, 1251, 15484, 88747, 138101, 0, 1, 7, 120, 3124, 79836, 1215783, 7409117, 11578037, 0, 1, 8, 174, 6925, 333004, 11620961, 199203464, 1252610909, 1961162564, 0
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
| |
| |
|
|
| |
|
|
A326225
|
|
Number of Hamiltonian unlabeled n-vertex digraphs (without loops).
|
|
+10
11
|
| |
| |
| |
|
|
| |
|
|
A326226
|
|
Number of unlabeled n-vertex Hamiltonian digraphs (with loops).
|
|
+10
10
|
| |
| |
| |
|
|
| |
|
|
A350415
|
|
Number of acyclic digraphs on n unlabeled nodes with a global source (or sink).
|
|
+10
10
|
|
|
|
1, 1, 3, 16, 164, 3341, 138101, 11578037, 1961162564, 668678055847, 457751797355605, 628137837068751147, 1726130748679532455689, 9493834992383031007906911, 104476428350838383854529661007, 2299979227717819421763629684068904
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
| |
| |
|
|
| |
|
|
A326221
|
|
Number of unlabeled n-vertex digraphs (with loops) containing a Hamiltonian path.
|
|
+10
9
|
| |
| |
| |
|
|
| |
|
|
A326224
|
|
Number of unlabeled n-vertex digraphs (with loops) not containing a Hamiltonian path.
|
|
+10
9
|
| |
| |
| |
|
Search completed in 0.016 seconds
|
