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.

A237591 Irregular triangle read by rows: T(n,k) is the difference between the total number of partitions of all positive integers <= n into exactly k consecutive parts, and the total number of partitions of all positive integers <= n into exactly k+1 consecutive parts (n>=1, 1<=k<=A003056(n)).

Table of values

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

List of values

[1, 2, 2, 1, 3, 1, 3, 2, 4, 1, 1, 4, 2, 1, 5, 2, 1, 5, 2, 2, 6, 2, 1, 1, 6, 3, 1, 1, 7, 2, 2, 1, 7, 3, 2, 1, 8, 3, 1, 2, 8, 3, 2, 1, 1, 9, 3, 2, 1, 1, 9, 4, 2, 1, 1, 10, 3, 2, 2, 1, 10, 4, 2, 2, 1, 11, 4, 2, 1, 2, 11, 4, 3, 1, 1, 1, 12, 4, 2, 2, 1, 1, 12, 5, 2, 2, 1, 1, 13, 4, 3, 2, 1, 1, 13, 5, 3, 1, 2, 1, 14, 5, 2, 2, 2, 1]