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.

A261555 Triangle read by rows: T(n,k) is number of partitions of n having at least k distinct parts (n >= 1, k >= 1).

Table of values

n a(n)
1 1
2 2
3 3
4 1
5 5
6 2
7 7
8 5
9 11
10 7
11 1
12 15
13 13
14 2
15 22
16 18
17 5
18 30
19 27
20 10
21 42
22 38
23 16
24 1
25 56
26 54
27 27
28 2
29 77
30 71
31 42
32 5
33 101
34 99
35 62
36 10
37 135
38 131
39 87
40 20
41 176
42 172
43 128
44 31
45 1
46 231
47 226
48 171
49 54
50 2
51 297
52 295
53 236
54 82
55 5
56 385
57 379
58 311
59 127
60 10
61 490
62 488
63 417
64 182
65 20

List of values

[1, 2, 3, 1, 5, 2, 7, 5, 11, 7, 1, 15, 13, 2, 22, 18, 5, 30, 27, 10, 42, 38, 16, 1, 56, 54, 27, 2, 77, 71, 42, 5, 101, 99, 62, 10, 135, 131, 87, 20, 176, 172, 128, 31, 1, 231, 226, 171, 54, 2, 297, 295, 236, 82, 5, 385, 379, 311, 127, 10, 490, 488, 417, 182, 20]