login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A249696 Number of distinct permanental polynomials among all simple undirected graphs on n nodes. 0

%I #11 Dec 19 2014 04:46:51

%S 1,1,2,4,11,34,153,1035,12247,274153,11999059,1018915198

%N Number of distinct permanental polynomials among all simple undirected graphs on n nodes.

%H Shunyi Liu, Jinjun Ren, <a href="http://arxiv.org/abs/1411.0184">Enumeration of copermanental graphs</a>, arXiv:1411.0184 [math.CO], (1-November-2014)

%Y Cf. A082104 (distinct characteristic polynomials).

%K nonn,hard,more

%O 0,3

%A _Joerg Arndt_, Nov 04 2014

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 01:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)