A350913
Number of oriented graphs on n unlabeled nodes whose underlying graph is regular.
Original entry on oeis.org
1, 1, 2, 3, 10, 17, 244, 2077, 181018, 12150445, 6986854715, 2456586421099, 12983287104044905, 40482495806423235417, 1213455558602787270259889, 29044259315697996254338202296, 6058969047090883735962137093497249, 785177832305082826579135707562767426031
Offset: 0
A351263
Triangle read by rows: T(n,k) is the number of oriented graphs on n labeled nodes whose underlying graph is k-regular, k = 0..n-1.
Original entry on oeis.org
1, 1, 2, 1, 0, 8, 1, 12, 48, 64, 1, 0, 384, 0, 1024, 1, 120, 4480, 35840, 61440, 32768, 1, 0, 59520, 0, 7618560, 0, 2097152, 1, 1680, 897792, 79278080, 1268449280, 3677356032, 1761607680, 268435456, 1, 0, 15368192, 0, 268535070720, 0, 4028679323648, 0, 68719476736
Offset: 1
Triangle begins:
1;
1, 2;
1, 0, 8;
1, 12, 48, 64;
1, 0, 384, 0, 1024;
1, 120, 4480, 35840, 61440, 32768;
1, 0, 59520, 0, 7618560, 0, 2097152;
...
Showing 1-2 of 2 results.
Comments