A301481 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A301481

Number of unlabeled uniform hypergraphs spanning n vertices.

1, 1, 2, 4, 12, 58, 2381, 14026281, 29284932065996445, 468863491068204425232922367150021, 1994324729204021501147398087008429476673379600542622915802043462326345

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,3

COMMENTS

A hypergraph is uniform if all edges have the same size.

LINKS

Alois P. Heinz, Table of n, a(n) for n = 0..14 (first 13 terms from Andrew Howroyd)

EXAMPLE

Non-isomorphic representatives of the a(4) = 12 hypergraphs:

{{1,2},{3,4}}

{{1},{2},{3},{4}}

{{1,3,4},{2,3,4}}

{{1,3},{2,4},{3,4}}

{{1,4},{2,4},{3,4}}

{{1,2,4},{1,3,4},{2,3,4}}

{{1,2},{1,3},{2,4},{3,4}}

{{1,4},{2,3},{2,4},{3,4}}

{{1,3},{1,4},{2,3},{2,4},{3,4}}

{{1,2,3},{1,2,4},{1,3,4},{2,3,4}}

{{1,2},{1,3},{1,4},{2,3},{2,4},{3,4}}

PROG

(PARI) \\ see A301922 for U(n, k).

a(n)={ if(n==0, 1, sum(k=1, n, U(n, k)-U(n-1, k))) } \\ Andrew Howroyd, Aug 10 2019

CROSSREFS

Row sums of A301922.

Cf. A003465, A038041, A055621, A298422, A301920, A306017-A306021.

Sequence in context: A363005 A000568 A177921 * A128648 A128646 A155747

Adjacent sequences: A301478 A301479 A301480 * A301482 A301483 A301484

KEYWORD

nonn

AUTHOR

Gus Wiseman, Jun 19 2018

EXTENSIONS

Terms a(6) and beyond from Andrew Howroyd, Aug 09 2019

STATUS

approved