cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-1 of 1 results.

A319490 Number of non-isomorphic connected graphs on n vertices with representation number 3.

Original entry on oeis.org

0, 0, 0, 0, 0, 1, 39, 1852, 88838
Offset: 1

Views

Author

Sergey Kitaev, Sep 20 2018

Keywords

Comments

These are graphs that can be represented by words having three copies of each letter, but cannot be represented by words having two copies of each letter. In a word representing a graph G, letters x and y alternate if any only if there is an edge between x and y in G.

Examples

			The triangular prism is the only graph on 6 vertices that can be represented using three copies of each letter, but cannot be represented using 2 copies of each letter.

Links

Crossrefs

Cf. A319489 (graphs with representation number 2).
Showing 1-1 of 1 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.