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.

A276661 Least k such that there is a set S in {1, 2, ..., k} with n elements and the property that each of its subsets has a distinct sum.

Table of values

n a(n)
0 0
1 1
2 2
3 4
4 7
5 13
6 24
7 44
8 84
9 161

List of values

[0, 1, 2, 4, 7, 13, 24, 44, 84, 161]