A334282 Number of properly colored labeled graphs on n nodes so that the color function is surjective onto {c_1,c_2,...,c_k} for some k, 1<=k<=n.

1, 1, 5, 73, 2849, 277921, 65067905, 35545840513, 44384640206849, 124697899490480641, 778525887500557625345, 10693248499002776513697793, 320453350845793018626300755969, 20807125028666778079876193487790081, 2909872870574162514727072641529432735745

Offset

0,3

Comments

Also 1 together with the row sums of A046860.

A binary relation R on [n] is periodic iff there is a d>=2 such that R^d = R. Let A be the class of non-arcless strongly connected periodic relations (A000629). Then a(n) is the number of binary relations on [n] whose strongly connected components are in A. - Geoffrey Critzer, Dec 12 2023

Links

Alois P. Heinz, Table of n, a(n) for n = 0..77

Formula

Sum_{n>=0} a_n*x^n/(n!*2^C(n,2)) = 1/(2-Sum_{n>=0} x^n/(n!*2^C(n,2))).

Maple

b:= proc(n, k) option remember; `if`([n, k]=[0$2], 1,
      add(binomial(n, r)*2^(r*(n-r))*b(r, k-1), r=0..n-1))
    end:
a:= n-> add(b(n, k), k=0..n):
seq(a(n), n=0..15);  # Alois P. Heinz, Apr 21 2020

Mathematica

nn = 15; e2[x_] := Sum[x^n/(n! 2^Binomial[n, 2]), {n, 0, nn}];
Table[n! 2^Binomial[n, 2], {n, 0, nn}] CoefficientList[Series[1/(1 - (e2[x] - 1)), {x, 0, nn}], x]

Crossrefs

Cf. A046860, A322280, A011266, A361560, A003024, A365534, A365590.

Sequence in context: A096538 A355122 A370542 * A317341 A012640 A353042

Adjacent sequences: A334279 A334280 A334281 * A334283 A334284 A334285

Keyword

nonn

Author

Geoffrey Critzer, Apr 21 2020

Status

approved