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.

A264401 Triangle read by rows: T(n,k) is the number of partitions of n having least gap k.

Table of values

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

List of values

[1, 0, 1, 1, 1, 1, 1, 1, 2, 2, 1, 2, 3, 2, 4, 4, 2, 1, 4, 6, 4, 1, 7, 8, 5, 2, 8, 11, 8, 3, 12, 15, 10, 4, 1, 14, 20, 15, 6, 1, 21, 26, 19, 9, 2, 24, 35, 27, 12, 3, 34, 45, 34, 17, 5, 41, 58, 47, 23, 6, 1, 55, 75, 59, 31, 10, 1, 66, 96, 79, 41, 13, 2]