login
Number of relations with 3 arguments on n nodes.
(Formerly M2180 N0872)
7

%I M2180 N0872 #42 Jul 02 2024 15:02:08

%S 2,136,22377984,768614354122719232,

%T 354460798875983863749270670915141632,

%U 146267071761884981524915186989628577728537526896649216991428608

%N Number of relations with 3 arguments on n nodes.

%D F. Bergeron, G. Labelle and P. Leroux, Combinatorial Species and Tree-Like Structures, Cambridge, 1998, p. 76 (2.2.31)

%D W. Oberschelp, Kombinatorische Anzahlbestimmungen in Relationen, Math. Ann., 174 (1967), 53-78.

%D N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

%H Alois P. Heinz, <a href="/A000662/b000662.txt">Table of n, a(n) for n = 1..15</a>

%H P. J. Cameron, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL3/groups.html">Sequences realized by oligomorphic permutation groups</a>, J. Integ. Seqs. Vol. 3 (2000), #00.1.5.

%H W. Oberschelp, <a href="/A000662/a000662.pdf">Strukturzahlen in endlichen Relationssystemen</a>, in Contributions to Mathematical Logic (Proceedings 1966 Hanover Colloquium), pp. 199-213, North-Holland Publ., Amsterdam, 1968. [Annotated scanned copy]

%F a(n) = Sum_{1*s_1+2*s_2+...=n} (fixA[s_1, s_2,...]/(1^s_1*s_1!*2^s_2*s_2!*...)) where fixA[s_1, s_2, ...] = 2^Sum_{i, j, k>=1} (i*j*k*s_i*s_j*s_k/lcm(i, j, k)). - _Christian G. Bower_, Jan 06 2004

%o (Python)

%o from itertools import product

%o from math import factorial, prod, lcm

%o from fractions import Fraction

%o from sympy.utilities.iterables import partitions

%o def A000662(n): return int(sum(Fraction(1<<sum(r*s*t//lcm(r,s,t)*p[r]*p[s]*p[t] for r,s,t in product(p.keys(),repeat=3)),prod(q**p[q]*factorial(p[q]) for q in p)) for p in partitions(n))) # _Chai Wah Wu_, Jul 02 2024

%Y Cf. A000595, A001377, A051241.

%K nonn,nice

%O 1,1

%A _N. J. A. Sloane_