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.

A135737 Ulam type (1-additive) sequences u[1]=2, u[2]=2n+1, u[k+1] is least unique sum u[i]+u[j]>u[k], 1<=i formatted as a table and read by antidiagonals.

Table of values

n a(n)
1 2
2 3
3 2
4 5
5 5
6 2
7 7
8 7
9 7
10 2
11 8
12 9
13 9
14 9
15 2
16 9
17 11
18 11
19 11
20 11
21 2
22 13
23 12
24 13
25 13
26 13
27 13
28 2
29 14
30 13
31 15
32 15
33 15
34 15
35 15
36 2
37 18
38 15
39 16
40 17
41 17
42 17
43 17
44 17
45 2
46 19
47 19
48 17
49 19
50 19
51 19
52 19
53 19
54 19
55 2
56 24
57 23
58 19
59 20
60 21
61 21
62 21
63 21
64 21
65 21
66 2
67 25
68 27
69 21
70 21
71 23
72 23
73 23
74 23
75 23
76 23
77 23

List of values

[2, 3, 2, 5, 5, 2, 7, 7, 7, 2, 8, 9, 9, 9, 2, 9, 11, 11, 11, 11, 2, 13, 12, 13, 13, 13, 13, 2, 14, 13, 15, 15, 15, 15, 15, 2, 18, 15, 16, 17, 17, 17, 17, 17, 2, 19, 19, 17, 19, 19, 19, 19, 19, 19, 2, 24, 23, 19, 20, 21, 21, 21, 21, 21, 21, 2, 25, 27, 21, 21, 23, 23, 23, 23, 23, 23, 23]