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.

A350293 a(n) is the 1st saturated vertex Turán number for the cube graph Q_n.

Original entry on oeis.org

1, 2, 6, 12, 24, 52, 112
Offset: 1

Views

Author

Stefano Spezia, Dec 23 2021

Keywords

Comments

The 1st saturated vertex Turán number for the cube graph Q_n is the maximum number of vertices to be deleted from the cube graph such that no subgraph Q_1 is complete and each of the deleted vertices being added again completes a subgraph Q_1 (see Harborth and Nienborg).

Links

Crossrefs

First column of A350292.
Cf. A000225, A350294.

Formula

a(n) = n*2^n/(n + 1) iff n is a Mersenne number (see Theorem 1 in Harborth and Nienborg).
a(n) <= A350294(n) (see Lemma 1 in Harborth and Nienborg).
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.