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.

A239302 Triangular array: T(n,k) = number of partitions x(1) > x(2) > ... > x(k) of n+2 such that x(1) = x(2) + k, for n >= 1.

Table of values

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

List of values

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