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.

A297673 Triangular array T(n, k) read by rows, n > 0, 0 < k <= n: T(n, k) = least unused positive value (reading rows from left to right) such that T(n, k) + T(n+1, k) + T(n+1, k+1) is prime.

Table of values

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

List of values

[1, 2, 4, 3, 6, 7, 5, 9, 8, 14, 10, 16, 12, 11, 18, 13, 20, 17, 24, 26, 15, 19, 21, 30, 32, 23, 22, 34, 25, 27, 31, 28, 29, 37, 38, 35, 33, 39, 41, 55, 44, 36, 40, 49, 43, 42, 52, 46, 50, 58, 47, 48, 51, 57, 63, 45, 62, 53, 64, 59, 56, 54, 61, 67, 69, 65, 60]