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.

A199162 a(1) = 1, a(2) = 6; for n>2, a(n) = least number > a(n-1) which is a unique sum of two distinct earlier terms.

Table of values

n a(n)
1 1
2 6
3 7
4 8
5 9
6 10
7 11
8 12
9 14
10 24
11 26
12 27
13 28
14 29
15 31
16 45
17 46
18 47
19 48
20 49
21 62
22 68
23 82
24 83
25 84
26 85
27 98
28 104
29 117
30 122
31 135
32 142
33 154
34 155
35 159
36 172
37 191
38 192
39 193
40 194
41 195
42 209
43 234
44 245
45 248
46 249
47 250
48 265
49 266
50 267
51 268
52 270
53 283
54 302
55 303
56 304
57 305
58 306

List of values

[1, 6, 7, 8, 9, 10, 11, 12, 14, 24, 26, 27, 28, 29, 31, 45, 46, 47, 48, 49, 62, 68, 82, 83, 84, 85, 98, 104, 117, 122, 135, 142, 154, 155, 159, 172, 191, 192, 193, 194, 195, 209, 234, 245, 248, 249, 250, 265, 266, 267, 268, 270, 283, 302, 303, 304, 305, 306]

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

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