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.

A011185 A B_2 sequence: a(n) = least value such that sequence increases and pairwise sums of distinct elements are all distinct.

Table of values

n a(n)
1 1
2 2
3 3
4 5
5 8
6 13
7 21
8 30
9 39
10 53
11 74
12 95
13 128
14 152
15 182
16 212
17 258
18 316
19 374
20 413
21 476
22 531
23 546
24 608
25 717
26 798
27 862
28 965
29 1060
30 1161
31 1307
32 1386
33 1435
34 1556
35 1722
36 1834
37 1934
38 2058
39 2261
40 2497
41 2699
42 2874
43 3061
44 3197
45 3332
46 3629
47 3712
48 3868
49 4140
50 4447
51 4640

List of values

[1, 2, 3, 5, 8, 13, 21, 30, 39, 53, 74, 95, 128, 152, 182, 212, 258, 316, 374, 413, 476, 531, 546, 608, 717, 798, 862, 965, 1060, 1161, 1307, 1386, 1435, 1556, 1722, 1834, 1934, 2058, 2261, 2497, 2699, 2874, 3061, 3197, 3332, 3629, 3712, 3868, 4140, 4447, 4640]