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.

A194703 Triangle read by rows: T(k,m) = number of occurrences of k in the last section of the set of partitions of (3 + m).

Table of values

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

List of values

[3, 2, 1, 0, 1, 2, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 3, 2, 1, 0, 1, 2, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0]