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.

A332567 T(n,k) is the k-th partition of n in graded reverse lexicographic ordering (A080577) encoded as concatenation of parts which are represented in (zeroless) bijective base-9 numeration (A052382) and separated by zeros; triangle T(n,k), n >= 0, 1 <= k <= A000041(n), read by rows.

Table of values

n a(n)
0 0
1 1
2 2
3 101
4 3
5 201
6 10101
7 4
8 301
9 202
10 20101
11 1010101
12 5
13 401
14 302
15 30101
16 20201
17 2010101
18 101010101
19 6
20 501
21 402
22 40101
23 303
24 30201
25 3010101
26 20202
27 2020101
28 201010101
29 10101010101
30 7
31 601
32 502
33 50101
34 403
35 40201
36 4010101
37 30301
38 30202
39 3020101
40 301010101

List of values

[0, 1, 2, 101, 3, 201, 10101, 4, 301, 202, 20101, 1010101, 5, 401, 302, 30101, 20201, 2010101, 101010101, 6, 501, 402, 40101, 303, 30201, 3010101, 20202, 2020101, 201010101, 10101010101, 7, 601, 502, 50101, 403, 40201, 4010101, 30301, 30202, 3020101, 301010101]