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.

A258280 Number T(n,k) of partitions of k copies of n into distinct parts; triangle T(n,k), n>=0, 0<=k<=max(1,ceiling(n/2)), read by rows.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 1
6 1
7 2
8 1
9 1
10 2
11 1
12 1
13 3
14 3
15 1
16 1
17 4
18 4
19 1
20 1
21 5
22 7
23 4
24 1
25 1
26 6
27 9
28 5
29 1
30 1
31 8
32 16
33 13
34 5
35 1
36 1
37 10
38 21
39 18
40 7
41 1
42 1
43 12
44 33
45 37
46 20
47 6
48 1
49 1
50 15
51 46
52 56
53 31
54 8
55 1
56 1
57 18
58 68
59 103
60 75
61 29
62 7
63 1
64 1
65 22
66 95
67 154
68 118
69 47
70 10
71 1
72 1
73 27
74 140
75 279
76 266
77 134
78 40
79 8
80 1

List of values

[1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 3, 3, 1, 1, 4, 4, 1, 1, 5, 7, 4, 1, 1, 6, 9, 5, 1, 1, 8, 16, 13, 5, 1, 1, 10, 21, 18, 7, 1, 1, 12, 33, 37, 20, 6, 1, 1, 15, 46, 56, 31, 8, 1, 1, 18, 68, 103, 75, 29, 7, 1, 1, 22, 95, 154, 118, 47, 10, 1, 1, 27, 140, 279, 266, 134, 40, 8, 1]