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.

A228099 Triangle read by rows, T(n, k) = prime(1)^p(k,1)*...*prime(n)^p(k,n) where p(k,j) is the j-th part of the k-th partition of n, additionally T(0,0) = 1. The partitions of n are ordered such that partitions of n into r parts appear in lexicographic order previous to the partitions of n into s parts if s < r. (Fenner-Loizou tree).

Table of values

n a(n)
0 1
1 2
2 6
3 4
4 30
5 12
6 8
7 210
8 60
9 36
10 24
11 16
12 2310
13 420
14 180
15 120
16 72
17 48
18 32
19 30030
20 4620
21 1260
22 840
23 900
24 360
25 240
26 216
27 144
28 96
29 64
30 510510
31 60060
32 13860
33 9240
34 6300
35 2520
36 1680
37 1800
38 1080
39 720
40 480
41 432
42 288
43 192
44 128
45 9699690
46 1021020
47 180180
48 120120

List of values

[1, 2, 6, 4, 30, 12, 8, 210, 60, 36, 24, 16, 2310, 420, 180, 120, 72, 48, 32, 30030, 4620, 1260, 840, 900, 360, 240, 216, 144, 96, 64, 510510, 60060, 13860, 9240, 6300, 2520, 1680, 1800, 1080, 720, 480, 432, 288, 192, 128, 9699690, 1021020, 180180, 120120]