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.

A124327 Triangle read by rows: T(n,k) is the number of partitions of the set {1,2,...,n} such that the sum of the least entries of the blocks is k (1<=k<=n*(n+1)/2).

Table of values

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

List of values

[1, 1, 0, 1, 1, 0, 2, 1, 0, 1, 1, 0, 4, 2, 1, 3, 2, 1, 0, 1, 1, 0, 8, 4, 2, 10, 6, 7, 2, 5, 3, 2, 1, 0, 1, 1, 0, 16, 8, 4, 29, 19, 21, 14, 23, 14, 18, 10, 7, 7, 5, 3, 2, 1, 0, 1, 1, 0, 32, 16, 8, 85, 56, 64, 42, 101, 62, 75, 69, 47, 54, 38, 38, 24, 23, 10, 13, 7, 5, 3, 2, 1, 0, 1, 1, 0, 64, 32, 16]