Andrew Howroyd, <a href="/A167625/b167625_1.txt">Table of n, a(n) for n = 1..378</a> (27 antidiagonals, first 19 antidiagonals from Jason Kimberley)
Andrew Howroyd, <a href="/A167625/b167625_1.txt">Table of n, a(n) for n = 1..378</a> (27 antidiagonals, first 19 antidiagonals from Jason Kimberley)
proposed
approved
editing
proposed
Square array T(n,k), read by upward antidiagonals, counting isomorphism classes of k-regular multigraphs of order n, loops allowed.
proposed
editing
editing
proposed
Terms may be computed without generating each graph by enumerating the number of graphs by degree sequence. A PARI program showing this technique for graphs with labeled vertices is given in A333467. Burnside's lemma can be used to extend this method to the unlabeled case. - Andrew Howroyd, Mar 23 2020
Array begins:
==============================================
n\k | 0 1 2 3 4 5 6 7
----+-----------------------------------------
1 | 1 0 1 0 1 0 1 0 ...
2 | 1 1 2 2 3 3 4 4 ...
3 | 1 0 3 0 7 0 13 0 ...
4 | 1 1 5 8 20 32 66 101 ...
5 | 1 0 7 0 56 0 384 0 ...
6 | 1 1 11 31 187 727 3369 12782 ...
7 | 1 0 15 0 654 0 40365 0 ...
8 | 1 1 22 140 2705 42703 675368 8584767 ...
...
approved
editing
editing
approved
Jason Kimberley (_Jason. Kimberley(AT)newcastle.edu.au), _, Nov 07 2009
approved
editing