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.

A064731 Number of connected integral graphs on n vertices.

Original entry on oeis.org

1, 1, 1, 2, 3, 6, 7, 22, 24, 83, 113, 325
Offset: 1

Views

Author

Gordon F. Royle, Oct 17 2001

Keywords

Comments

An integral graph is defined by the property that all of the eigenvalues of its adjacency matrix are integral.

Examples

			The three integral graphs on five vertices are the star K1,4, the complete graph K5 and the complete join (K2 join 3K1).
		

Crossrefs

Cf. A077027 (number of simple not necessarily connected integral graphs).
Cf. A287154 (number of simple disconnected integral graphs).
Cf. A363064 (number of connected Laplacian integral graphs).

Formula

a(n) = A077027(n) - A287154(n).

Extensions

a(11) = 236 and a(12) = 325 (from the BCRSS paper) sent by Felix Goldberg (felixg(AT)tx.technion.ac.il), Oct 06 2003; however, it appears that those numbers were incorrect
a(11) = 113 from Gordon F. Royle, Dec 30 2003; confirmed by Krystyna Balinska, Apr 19 2004
a(12) = 325 from the BKSK 2001 paper added by Dragan Stevanovic, Jan 29 2020