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.

A180459 Sampling n numbers between 1 and a(n)-1, you are guaranteed to always find two subsets whose sums are equal.

Table of values

n a(n)
3 3
4 5
5 8
6 13
7 21
8 36
9 61
10 107
11 191
12 347
13 636
14 1177
15 2192
16 4104
17 7718
18 14572
19 27603
20 52439
21 99875
22 190661
23 364733
24 699063
25 1342190
26 2581123
27 4971040
28 9586994
29 18512804
30 35791409
31 69273681
32 134217744
33 260301065
34 505290287
35 981706828

List of values

[3, 5, 8, 13, 21, 36, 61, 107, 191, 347, 636, 1177, 2192, 4104, 7718, 14572, 27603, 52439, 99875, 190661, 364733, 699063, 1342190, 2581123, 4971040, 9586994, 18512804, 35791409, 69273681, 134217744, 260301065, 505290287, 981706828]