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.

A368184 Least k such that there are exactly n ways to choose a set consisting of a different binary index of each binary index of k.

Table of values

n a(n)
0 7
1 1
2 4
3 20
4 276
5 320
6 1088
7 65856
8 66112
9 66624
10 263232

List of values

[7, 1, 4, 20, 276, 320, 1088, 65856, 66112, 66624, 263232]