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.

A097364 Triangle read by rows, 0 <= k < n: T(n,k) = number of partitions of n such that the differences between greatest and smallest parts are k.

Table of values

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

List of values

[1, 2, 0, 2, 1, 0, 3, 1, 1, 0, 2, 3, 1, 1, 0, 4, 2, 3, 1, 1, 0, 2, 5, 3, 3, 1, 1, 0, 4, 4, 6, 3, 3, 1, 1, 0, 3, 6, 6, 7, 3, 3, 1, 1, 0, 4, 6, 10, 7, 7, 3, 3, 1, 1, 0, 2, 9, 10, 12, 8, 7, 3, 3, 1, 1, 0, 6, 6, 15, 14, 13, 8, 7, 3, 3, 1, 1, 0, 2, 11, 15, 20, 16, 14, 8, 7, 3, 3, 1, 1, 0, 4, 10, 21, 22, 24, 17]