OFFSET
1,2
COMMENTS
Also, number of graphs with vertices labeled 1, 2, ..., n such that their degrees are nondecreasing.
PROG
(Sage) def A351287(n): return sum(prod(factorial(e) for e in Partition((d+1 for d in G.degree_sequence())).to_exp()) // G.automorphism_group(return_group=False, order=True) for G in graphs(n))
(PARI) \\ See link in A295193 for GraphsByDegreeSeq.
a(n)={my(M=GraphsByDegreeSeq(n, n, (p, r)->1)); sum(i=1, matsize(M)[1], my(u=Vec(M[i, 1])); prod(j=1, #u, u[j]!)*M[i, 2]/n!)} \\ Andrew Howroyd, Feb 06 2022
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Max Alekseyev, Feb 06 2022
EXTENSIONS
a(11)-a(14) from Andrew Howroyd, Feb 06 2022
STATUS
approved