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.

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

Table of values

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

List of values

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