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.

A177254 Triangle read by rows: T(n,k) is the number of partitions of the set {1,2,...,n} having k adjacent blocks (0 <= k <= n). An adjacent block is a block of the form (i, i+1, i+2, ...).

Table of values

n a(n)
0 1
1 0
2 1
3 0
4 1
5 1
6 0
7 2
8 2
9 1
10 1
11 4
12 6
13 3
14 1
15 5
16 13
17 17
18 12
19 4
20 1
21 21
22 51
23 61
24 44
25 20
26 5
27 1
28 91
29 219
30 255
31 185
32 90
33 30
34 6
35 1
36 422
37 1019
38 1182
39 867
40 440
41 160
42 42
43 7
44 1
45 2103
46 5108
47 5964
48 4430
49 2322
50 896
51 259
52 56
53 8
54 1
55 11226
56 27448
57 32373
58 24406
59 13118
60 5292
61 1638
62 392
63 72
64 9
65 1

List of values

[1, 0, 1, 0, 1, 1, 0, 2, 2, 1, 1, 4, 6, 3, 1, 5, 13, 17, 12, 4, 1, 21, 51, 61, 44, 20, 5, 1, 91, 219, 255, 185, 90, 30, 6, 1, 422, 1019, 1182, 867, 440, 160, 42, 7, 1, 2103, 5108, 5964, 4430, 2322, 896, 259, 56, 8, 1, 11226, 27448, 32373, 24406, 13118, 5292, 1638, 392, 72, 9, 1]