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.

A244740 Irregular triangular array read by rows: T(n,k) = number of positive integers m such that (prime(n) mod m) = k, for k=1..(-1 + prime(k))/2.

Table of values

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

List of values

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