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.

A244966 Triangle read by rows: T(n,k) is the difference between the largest and the smallest part of the k-th partition in the list of colexicographically ordered partitions of n, with n>=1 and 1<=k<=p(n), where p(n) is the number of partitions of n.

Table of values

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

List of values

[0, 0, 0, 0, 1, 0, 0, 1, 2, 0, 0, 0, 1, 2, 1, 3, 1, 0, 0, 1, 2, 1, 3, 2, 4, 0, 2, 0, 0, 0, 1, 2, 1, 3, 2, 4, 1, 3, 2, 5, 1, 3, 1, 0, 0, 1, 2, 1, 3, 2, 4, 1, 3, 2, 5, 2, 4, 3, 6, 0, 2, 1, 4, 2, 0, 0, 0, 1, 2, 1, 3, 2, 4, 1, 3, 2, 5, 2, 4, 3, 6, 1, 3, 2, 5, 4, 3, 7, 1, 3, 2, 5, 0, 3, 1, 0]