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.

A072528 Table T(n,k) read by rows, giving number of occurrences of the remainder k when n is divided by i=1,2,3,...,n.

Table of values

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

List of values

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