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.

A196930 Triangle read by rows in which row n lists in nondecreasing order the smallest part of every partition of n that do not contain 1 as a part, with a(1) = 1.

Table of values

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

List of values

[1, 2, 3, 2, 4, 2, 5, 2, 2, 3, 6, 2, 2, 3, 7, 2, 2, 2, 2, 3, 4, 8, 2, 2, 2, 2, 3, 3, 4, 9, 2, 2, 2, 2, 2, 2, 2, 3, 3, 4, 5, 10, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 4, 5, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 5, 6, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 4, 4, 5, 6, 13]