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.

A005282 Mian-Chowla sequence (a B_2 sequence): a(1) = 1; for n>1, a(n) = smallest number > a(n-1) such that the pairwise sums of elements are all distinct.

Table of values

n a(n)
1 1
2 2
3 4
4 8
5 13
6 21
7 31
8 45
9 66
10 81
11 97
12 123
13 148
14 182
15 204
16 252
17 290
18 361
19 401
20 475
21 565
22 593
23 662
24 775
25 822
26 916
27 970
28 1016
29 1159
30 1312
31 1395
32 1523
33 1572
34 1821
35 1896
36 2029
37 2254
38 2379
39 2510
40 2780
41 2925
42 3155
43 3354
44 3591
45 3797
46 3998
47 4297
48 4433
49 4779
50 4851

List of values

[1, 2, 4, 8, 13, 21, 31, 45, 66, 81, 97, 123, 148, 182, 204, 252, 290, 361, 401, 475, 565, 593, 662, 775, 822, 916, 970, 1016, 1159, 1312, 1395, 1523, 1572, 1821, 1896, 2029, 2254, 2379, 2510, 2780, 2925, 3155, 3354, 3591, 3797, 3998, 4297, 4433, 4779, 4851]