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.

A104382 Triangle, read by rows, where T(n,k) equals number of distinct partitions of triangular number n*(n+1)/2 into k different summands for n>=k>=1.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 2
6 1
7 1
8 4
9 4
10 1
11 1
12 7
13 12
14 6
15 1
16 1
17 10
18 27
19 27
20 10
21 1
22 1
23 13
24 52
25 84
26 57
27 14
28 1
29 1
30 17
31 91
32 206
33 221
34 110
35 21
36 1
37 1
38 22
39 147
40 441
41 674
42 532
43 201
44 29
45 1
46 1
47 27
48 225
49 864
50 1747
51 1945
52 1175
53 352
54 41
55 1
56 1
57 32
58 331
59 1575
60 4033
61 5942
62 5102
63 2462
64 598
65 55
66 1
67 1
68 38
69 469

List of values

[1, 1, 1, 1, 2, 1, 1, 4, 4, 1, 1, 7, 12, 6, 1, 1, 10, 27, 27, 10, 1, 1, 13, 52, 84, 57, 14, 1, 1, 17, 91, 206, 221, 110, 21, 1, 1, 22, 147, 441, 674, 532, 201, 29, 1, 1, 27, 225, 864, 1747, 1945, 1175, 352, 41, 1, 1, 32, 331, 1575, 4033, 5942, 5102, 2462, 598, 55, 1, 1, 38, 469]