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.

User: Woosuk Kwak

Woosuk Kwak's wiki page.

Woosuk Kwak has authored 2 sequences.

A350418 a(n) is the number of universal binary n-state logic gates.

Original entry on oeis.org

1, 2, 3774, 942897552, 76897278357005640
Offset: 1

Author

Woosuk Kwak, Dec 29 2021

Keywords

Comments

The number of closed binary operations F on a set of order n such that {F} is functionally complete.
a(3) computed by Craig Gidney, corrected by Code Golf Stack Exchange user AnttiP.
a(4) computed by Code Golf Stack Exchange user AnttiP.
a(5) computed by Code Golf Stack Exchange user gsitcia.

Examples

			For n = 2, the two universal logic gates are NAND and NOR.
		

Crossrefs

A002489(n) counts all binary n-state logic gates.

Formula

Limit_{n->oo} a(n)/A002489(n) = 1/e.

Extensions

a(5) added by Woosuk Kwak, Nov 23 2023

A342963 a(n) is the number of sticky polyhexes with 2*n cells.

Original entry on oeis.org

1, 2, 15, 110, 1051, 10636, 113290, 1234189, 13674761, 153289285
Offset: 1

Author

Woosuk Kwak, Mar 31 2021

Keywords

Comments

A sticky polyhex is defined as follows:
- A single dihex (polyhex of size 2) is a sticky polyhex.
- If a polyhex X is sticky, X plus a dihex Y is also sticky if X and Y share at least two unit sides.
- Any polyhex that cannot be formed by the above definition is not sticky.
This sequence counts free polyhexes; two polyhexes which are equivalent under reflection and/or rotation are counted only once.
a(n) < A000228(2n) for n > 1.

Examples

			The two sticky tetrahexes are:
    * *    * * *
     * *    *
The following is the full list of 15 sticky hexahexes (polyhexes of size 6):
    * * *    * * *    *        * * * *    * * *
     * *      * *    * * * *    * *          * * *
      *          *        *
---
    * *       *        * *       * *     * * *
     * * *   * * * *    * * *   * * *       * *
        *       *      *         *         *
---
    * * *    * * *    * * * *   * * *    * * *
       * *    * * *    *   *       *        * *
          *                       * *        *
		

Crossrefs

Cf. A000228.