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.

A222192 a(n) = number of inequivalent ways to choose a subset of the n*2^(n-1) edges of the n-cube so that the resulting figure is connected and fully n-dimensional.

Table of values

n a(n)
1 1
2 3
3 78
4 7338218

List of values

[1, 3, 78, 7338218]

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

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