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-3 of 3 results.

A361186 Number of chordless cycles in the halved cube graph Q_n/2.

Original entry on oeis.org

0, 0, 0, 6, 252, 14904, 9021648, 1059526463616
Offset: 1

Views

Author

Eric W. Weisstein, Mar 03 2023

Keywords

Comments

Using the convention that chordless cycles have length >= 4.

Links

Crossrefs

Cf. A358356, A361149, A361187.

Extensions

a(7) = 9021648 from Eric W. Weisstein, Apr 16 2023
a(8) from Pontus von Brömssen, Apr 16 2023

A361187 Number of chordless cycles in the n-folded cube graph.

Original entry on oeis.org

0, 0, 36, 312, 20264, 136507408
Offset: 2

Views

Author

Eric W. Weisstein, Mar 03 2023

Keywords

Comments

Using the convention that chordless cycles have length >= 4.
Without that convention, the only difference is that a(3) would be 4. - Pontus von Brömssen, Mar 10 2023

Links

Crossrefs

Cf. A358358, A361149, A361186.

Extensions

a(7) from Pontus von Brömssen, Apr 17 2023

A364370 Number of chordless cycles (of length > 3) in the complement of the n-hypercube graph.

Original entry on oeis.org

0, 0, 0, 6, 160, 1720, 13056, 82656, 470016, 2496384, 12666880, 62250496, 298868736, 1409660928, 6556483584, 30148976640, 137316794368, 620328091648, 2782435737600, 12402204475392, 54971691171840, 242433274675200
Offset: 0

Views

Author

Eric W. Weisstein, Jul 20 2023

Keywords

Links

Crossrefs

Cf. A361149.

Programs

  • Mathematica
    a[n_] := 2^(n - 2)*n*Sum[Sum[4*((k + 2)*2^(k - 5) - 1),{k, 3, n-j}], {j, 0, n-3}]; Table[a[n], {n, 0, 21}] (* Detlef Meya, Jun 23 2024 *)

Formula

a(n) = 2^(n - 2)*n*Sum_{j=0..n-3} Sum_{k=3..n-j} 4*((k + 2)*2^(k - 5) - 1). - Detlef Meya, Jun 23 2024

Extensions

a(10) from Pontus von Brömssen, Jul 28 2023
a(11) and beyond from Detlef Meya, Jun 23 2024
Showing 1-3 of 3 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.