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.

A364153 a(n) is the smallest positive integer such that from the set {1, 2, ..., a(n)} one can choose a sequence (s(1), s(2), ..., s(n)) in which every segment has a unique sum.

Table of values

n a(n)
1 1
2 2
3 3
4 5
5 6
6 7
7 9
8 10
9 12
10 13
11 14
12 17
13 18

List of values

[1, 2, 3, 5, 6, 7, 9, 10, 12, 13, 14, 17, 18]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.