A370741 - OEIS

%I #25 Apr 24 2024 10:53:20

%S 1,1,3,21,279,6129,210987,11813949,1212514191,258945624441,

%T 119434656926403,115822196942035936,230278743809297350656,

%U 927472598521910778658816,7524503812375420895515115520,122594420168978189387577050529792,4004323623554618525117142486495526912

%N Number of 3-edge-colorings of the complete graph on n labeled vertices without rainbow colored triangles.

%C A rainbow colored triangle is a triangle (3-clique) in which each of the edges has a different color.

%C The initial terms were calculated using a computer algorithm derived from a recursive formula based on the characteristics of 3-edge-colored cliques without rainbow colored triangles.

%H Jing Chen, <a href="/A370741/b370741.txt">Table of n, a(n) for n = 0..45</a>

%H Jing Chen, <a href="/A370741/a370741.pdf">The Number of Labelled Edge-3-coloured Cliques without Rainbow Triangles</a>.

%H Jing Chen, <a href="/A370741/a370741_2.py.txt">Python program</a>

%K nonn

%O 0,3

%A _Jing Chen_, Feb 27 2024