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.

A259324 Infinite square array read by antidiagonals: T(n,k) = number of ways of partitioning numbers <= n into k parts (n >= 0, k >= 1).

Table of values

n a(n)
0 1
1 1
2 2
3 1
4 2
5 3
6 1
7 2
8 4
9 4
10 1
11 2
12 4
13 6
14 5
15 1
16 2
17 4
18 7
19 9
20 6
21 1
22 2
23 4
24 7
25 11
26 12
27 7
28 1
29 2
30 4
31 7
32 12
33 16
34 16
35 8
36 1
37 2
38 4
39 7
40 12
41 18
42 23
43 20
44 9
45 1
46 2
47 4
48 7
49 12
50 19
51 27
52 31
53 25
54 10
55 1
56 2
57 4
58 7
59 12
60 19
61 29
62 38
63 41
64 30
65 11
66 1
67 2
68 4
69 7
70 12
71 19
72 30
73 42
74 53
75 53
76 36
77 12
78 1
79 2
80 4
81 7
82 12
83 19
84 30
85 44
86 60
87 71
88 67
89 42
90 13
91 1
92 2
93 4
94 7
95 12
96 19
97 30
98 45
99 64
100 83
101 94
102 83
103 49
104 14
105 1
106 2

List of values

[1, 1, 2, 1, 2, 3, 1, 2, 4, 4, 1, 2, 4, 6, 5, 1, 2, 4, 7, 9, 6, 1, 2, 4, 7, 11, 12, 7, 1, 2, 4, 7, 12, 16, 16, 8, 1, 2, 4, 7, 12, 18, 23, 20, 9, 1, 2, 4, 7, 12, 19, 27, 31, 25, 10, 1, 2, 4, 7, 12, 19, 29, 38, 41, 30, 11, 1, 2, 4, 7, 12, 19, 30, 42, 53, 53, 36, 12, 1, 2, 4, 7, 12, 19, 30, 44, 60, 71, 67, 42, 13, 1, 2, 4, 7, 12, 19, 30, 45, 64, 83, 94, 83, 49, 14, 1, 2]