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.

A088643 Triangle read by rows: row n >= 1 is obtained as follows. Start with n, next term is always largest number m with 1 <= m < n which has not yet appeared in that row and such that m + previous term in the row is a prime. Stop when no further m can be found.

Table of values

n a(n)
1 1
2 2
3 1
4 3
5 2
6 1
7 4
8 3
9 2
10 1
11 5
12 2
13 3
14 4
15 1
16 6
17 5
18 2
19 3
20 4
21 1
22 7
23 6
24 5
25 2
26 3
27 4
28 1
29 8
30 5
31 6
32 7
33 4
34 3
35 2
36 1
37 9
38 8
39 5
40 6
41 7
42 4
43 3
44 2
45 1
46 10
47 9
48 8
49 5
50 6
51 7
52 4
53 3
54 2
55 1
56 11
57 8
58 9
59 10
60 7
61 6
62 5
63 2
64 3
65 4
66 1
67 12
68 11
69 8
70 9
71 10
72 7
73 6
74 5
75 2
76 3
77 4
78 1
79 13
80 10
81 9
82 8
83 11
84 12
85 7
86 6
87 5
88 2
89 3
90 4
91 1
92 14
93 9
94 10
95 13
96 6
97 11
98 12
99 7
100 4
101 3
102 8
103 5
104 2
105 1

List of values

[1, 2, 1, 3, 2, 1, 4, 3, 2, 1, 5, 2, 3, 4, 1, 6, 5, 2, 3, 4, 1, 7, 6, 5, 2, 3, 4, 1, 8, 5, 6, 7, 4, 3, 2, 1, 9, 8, 5, 6, 7, 4, 3, 2, 1, 10, 9, 8, 5, 6, 7, 4, 3, 2, 1, 11, 8, 9, 10, 7, 6, 5, 2, 3, 4, 1, 12, 11, 8, 9, 10, 7, 6, 5, 2, 3, 4, 1, 13, 10, 9, 8, 11, 12, 7, 6, 5, 2, 3, 4, 1, 14, 9, 10, 13, 6, 11, 12, 7, 4, 3, 8, 5, 2, 1]