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.

A078882 Number of subsets S of {1,2,3,...,n} with the largest possible cardinality consistent with the requirement that if i and j are distinct elements of S then i XOR j is not in S. XOR is the bitwise exclusive-OR operator.

Original entry on oeis.org

1, 1, 3, 3, 1, 3, 7, 7, 3, 1, 1, 1, 3, 7, 15, 15, 7, 3, 3, 1, 1, 1, 1, 1, 1, 1, 3, 3, 7, 15, 31, 31, 15, 7, 7, 3, 3, 3, 3, 1, 1, 1
Offset: 1

Views

Author

John W. Layman, Dec 11 2002

Keywords

Crossrefs

Cf. A078881.

Extensions

a(34)-a(42) from Sean A. Irvine, Jul 22 2025