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.

A384870 The largest k such that the set {1^n, 2^n, ..., k^n} has uniquely distinct subset sums.

Table of values

n a(n)
0 1
1 2
2 4
3 5
4 8
5 11
6 15
7 19
8 21
9 28
10 30
11 37
12 42
13 45
14 45

List of values

[1, 2, 4, 5, 8, 11, 15, 19, 21, 28, 30, 37, 42, 45, 45]