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.

A228100 Triangle in which n-th row lists all partitions of n, such that partitions of n into m parts appear in lexicographic order previous to the partitions of n into k parts if k < m. (Fenner-Loizou tree.)

Table of values

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

List of values

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