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.

A049843 Triangular array T read by rows: T(n,k)=number of nonzero remainders when Euclidean algorithm acts on primes prime(n) and prime(k), k=1,2,...,n-1; n=2,3,4,...

Table of values

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

List of values

[1, 1, 2, 1, 1, 2, 1, 2, 1, 3, 1, 1, 3, 2, 2, 1, 2, 2, 2, 3, 2, 1, 1, 2, 3, 4, 2, 2, 1, 2, 3, 2, 1, 3, 3, 3, 1, 2, 2, 1, 4, 2, 4, 3, 3, 1, 1, 1, 2, 3, 4, 4, 5, 3, 2, 1, 1, 2, 2, 3, 3, 3, 2, 5, 5, 2, 1, 2, 1, 2, 4, 2, 3, 2, 5, 4, 2, 2, 1, 1, 3, 1, 2, 2, 3, 3]