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.

A117468 Triangle read by rows: T(n,k) is the number of partitions of n in which every integer from the smallest part to the largest part k occurs (1<=k<=n).

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 1, 2, 0, 1, 1, 2, 1, 0, 1, 1, 3, 2, 0, 0, 1, 1, 3, 2, 1, 0, 0, 1, 1, 4, 3, 1, 0, 0, 0, 1, 1, 4, 5, 1, 1, 0, 0, 0, 1, 1, 5, 5, 2, 1, 0, 0, 0, 0, 1, 1, 5, 7, 3, 0, 1, 0, 0, 0, 0, 1, 1, 6, 9, 4, 1, 1, 0, 0, 0, 0, 0, 1, 1, 6, 10, 6, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 7, 12, 7, 2, 0, 1, 0, 0, 0, 0, 0, 0, 1]