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.

A194548 Triangle read by rows: T(n,k) = number of parts in the k-th partition of n that does not contain 1 as a part, with partitions in lexicographic order.

Table of values

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

List of values

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