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.

A068906 Square array read by ascending antidiagonals of partitions of k modulo n.

Table of values

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

List of values

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