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.

A194621 Triangle T(n,k), n>=0, 0<=k<=n, read by rows: T(n,k) is the number of partitions of n in which any two parts differ by at most k.

Table of values

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

List of values

[1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 5, 5, 5, 2, 5, 6, 7, 7, 7, 4, 6, 9, 10, 11, 11, 11, 2, 7, 10, 13, 14, 15, 15, 15, 4, 8, 14, 17, 20, 21, 22, 22, 22, 3, 9, 15, 22, 25, 28, 29, 30, 30, 30, 4, 10, 20, 27, 34, 37, 40, 41, 42, 42, 42, 2, 11, 21, 33, 41, 48, 51, 54, 55, 56, 56, 56]