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.

A359350 Irregular triangle T(n,k) (n >= 1, k >= 1) read by rows: row n is constructed by replacing A336811(n,k) with the largest partition into consecutive parts of A000217(A336811(n,k)).

Table of values

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

List of values

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