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.

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

Table of values

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

List of values

[11, 3, 8, 2, 3, 6, 1, 3, 2, 5, 1, 1, 2, 3, 4, 0, 1, 1, 2, 2, 5, 1, 0, 1, 1, 2, 2, 4, 0, 1, 0, 1, 1, 2, 2, 4, 0, 0, 1, 0, 1, 1, 2, 2, 4, 0, 0, 0, 1, 0, 1, 1, 2, 2, 4, 0, 0, 0, 0, 1, 0, 1, 1, 2, 2, 4, 0, 0, 0, 0, 0, 1, 0, 1, 1, 2, 2, 4, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 2, 2, 4]