A368761 Number of labeled split graphs on n vertices such that {1..k} is independent and {k+1..n} is a clique for some k in {0..n}.

1, 2, 6, 24, 128, 928, 9280, 129152, 2515200, 68780544, 2647000064, 143580989440, 10988411686912, 1187350176604160, 181232621966082048, 39089521693818912768, 11916533065969825808384, 5135497592471003032846336, 3128995097443083790244380672, 26956139043, 12277811648715554816

Offset

1,2

Comments

Also the number of sign mappings X:([n] choose 2) -> {+,-} such that for any ordered 3-tuple abc we have X(ab)X(ac)X(bc) not in {++-,+--}.

Links

Table of n, a(n) for n=1..21.

Formula

a(n) = 1 + Sum_{k=1..n-1} (2^k-1)*2^((n-1-k)*k).

Prog

(Python) def f(n): return 1+sum((2**k-1)*2**((n-1-k)*k) for k in range(1, n))

Crossrefs

Cf. A048194.

Sequence in context: A201158 A356634 A191343 * A052862 A277211 A370017

Adjacent sequences: A368758 A368759 A368760 * A368762 A368763 A368764

Keyword

nonn

Author

Robert Lauff and Manfred Scheucher, Jan 05 2024

Status

approved