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.

A377852 Triangle T(n,k) read by rows in which n-th row lists in increasing order all multiplicative partitions mu of n whose sum is also n (with factors >= 1), encoded as Product_{j in mu} prime(j); n>=1, 1<=k<=A001055(n).

Table of values

n a(n)
1 2
2 3
3 5
4 7
5 9
6 11
7 13
8 30
9 17
10 19
11 84
12 108
13 23
14 200
15 29
16 264
17 31
18 37
19 624
20 1120
21 1440
22 41
23 43
24 1632
25 47
26 7040
27 53
28 3648
29 12544
30 16128
31 20736
32 59
33 61
34 8832
35 33280
36 76800
37 67
38 71
39 22272
40 157696
41 202752
42 73
43 174080
44 79
45 47616
46 83
47 89
48 113664
49 778240
50 1490944
51 1916928
52 3440640
53 4423680

List of values

[2, 3, 5, 7, 9, 11, 13, 30, 17, 19, 84, 108, 23, 200, 29, 264, 31, 37, 624, 1120, 1440, 41, 43, 1632, 47, 7040, 53, 3648, 12544, 16128, 20736, 59, 61, 8832, 33280, 76800, 67, 71, 22272, 157696, 202752, 73, 174080, 79, 47616, 83, 89, 113664, 778240, 1490944, 1916928, 3440640, 4423680]