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!)
A007719 Number of independent polynomial invariants of symmetric matrix of order n. 12

%I #39 Oct 23 2019 14:35:38

%S 1,2,4,11,30,95,328,1211,4779,19902,86682,393072,1847264,8965027,

%T 44814034,230232789,1213534723,6552995689,36207886517,204499421849,

%U 1179555353219,6942908667578,41673453738272,254918441681030,1588256152307002,10073760672179505

%N Number of independent polynomial invariants of symmetric matrix of order n.

%C Also, number of connected multigraphs with n edges (allowing loops) and any number of nodes.

%C Also the number of non-isomorphic connected multiset partitions of {1, 1, 2, 2, 3, 3, ..., n, n}. - _Gus Wiseman_, Jul 18 2018

%H Andrew Howroyd, <a href="/A007719/b007719.txt">Table of n, a(n) for n = 0..50</a>

%H R. J. Mathar, <a href="http://arxiv.org/abs/1709.09000">Statistics on Small Graphs</a>, arXiv:1709.09000 [math.CO] (2017) Table 63.

%F Inverse Euler transform of A007717.

%e From _Gus Wiseman_, Jul 18 2018: (Start)

%e Non-isomorphic representatives of the a(3) = 11 connected multiset partitions of {1, 1, 2, 2, 3, 3}:

%e (112233),

%e (1)(12233), (12)(1233), (112)(233), (123)(123),

%e (1)(2)(1233), (1)(12)(233), (1)(23)(123), (12)(13)(23),

%e (1)(2)(3)(123), (1)(2)(13)(23).

%e (End)

%t mob[m_, n_] := If[Mod[m, n] == 0, MoebiusMu[m/n], 0];

%t EULERi[b_] := Module[{a, c, i, d}, c = {}; For[i = 1, i <= Length[b], i++,

%t c = Append[c, i*b[[i]] - Sum[c[[d]]*b[[i - d]], {d, 1, i - 1}]]]; a = {};

%t For[i = 1, i <= Length[b], i++, a = Append[a, (1/i)*Sum[mob[i, d]*c[[d]], {d, 1, i}]]]; Return[a]];

%t permcount[v_] := Module[{m = 1, s = 0, k = 0, t}, For[i = 1, i <= Length[v], i++, t = v[[i]]; k = If[i > 1 && t == v[[i - 1]], k + 1, 1]; m *= t k; s += t]; s!/m];

%t Kq[q_, t_, k_] := SeriesCoefficient[1/Product[g = GCD[t, q[[j]]]; (1 - x^(q[[j]]/g))^g, {j, 1, Length[q]}], {x, 0, k}];

%t RowSumMats[n_, m_, k_] := Module[{s = 0}, Do[s += permcount[q]* SeriesCoefficient[ Exp[Sum[Kq[q, t, k]/t x^t, {t, 1, n}]], {x, 0, n}], {q, IntegerPartitions[m]}]; s/m!];

%t A007717 = Table[Print[n]; RowSumMats[n, 2 n, 2], {n, 0, 20}];

%t Join[{1}, EULERi[Rest[A007717]]] (* _Jean-François Alcover_, Oct 29 2018, using _Andrew Howroyd_'s code for A007717 *)

%Y Row sums of A322115.

%Y Cf. A002905, A007716, A007717, A007719, A020555, A050535, A053419, A076864, A191970, A316972, A316974.

%K nonn,nice

%O 0,2

%A _Colin Mallows_

%E a(0)=1 added by _Alberto Tacchella_, Jun 20 2011

%E a(7)-a(25) from _Franklin T. Adams-Watters_, Jun 21 2011

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 23 08:19 EDT 2024. Contains 371905 sequences. (Running on oeis4.)