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.

A177740 Triangle read by rows in which row n lists the number of parts in each of those partitions of n that have every part >=3.

Table of values

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

List of values

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