login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A249696
Number of distinct permanental polynomials among all simple undirected graphs on n nodes.
0
1, 1, 2, 4, 11, 34, 153, 1035, 12247, 274153, 11999059, 1018915198
OFFSET
0,3
LINKS
Shunyi Liu, Jinjun Ren, Enumeration of copermanental graphs, arXiv:1411.0184 [math.CO], (1-November-2014)
CROSSREFS
Cf. A082104 (distinct characteristic polynomials).
Sequence in context: A071115 A357891 A217043 * A156809 A215620 A076317
KEYWORD
nonn,hard,more
AUTHOR
Joerg Arndt, Nov 04 2014
STATUS
approved