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.

A177256 Triangle read by rows: T(n,k) is the number of partitions of the set {1,2,...,n} having exactly k blocks that do not consist of consecutive integers (0<=k<=floor(n/2); a singleton is considered a block of consecutive integers).

Table of values

n a(n)
0 1
1 1
2 2
3 0
4 4
5 1
6 8
7 6
8 1
9 16
10 25
11 11
12 32
13 89
14 77
15 5
16 64
17 290
18 433
19 90
20 128
21 893
22 2132
23 951
24 36
25 256
26 2645
27 9602
28 7710
29 934
30 512
31 7618
32 40589
33 53137
34 13790
35 329
36 1024
37 21489
38 163739
39 328119
40 152600
41 11599
42 2048
43 59665
44 637587
45 1872748
46 1409791
47 228103

List of values

[1, 1, 2, 0, 4, 1, 8, 6, 1, 16, 25, 11, 32, 89, 77, 5, 64, 290, 433, 90, 128, 893, 2132, 951, 36, 256, 2645, 9602, 7710, 934, 512, 7618, 40589, 53137, 13790, 329, 1024, 21489, 163739, 328119, 152600, 11599, 2048, 59665, 637587, 1872748, 1409791, 228103]