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.

A184174 Triangle read by rows: T(n,k) is the number of partitions of the set {1,2,...,n} having k adjacent blocks of size 2, i.e., blocks of the form (i,i+1) (0 <= k <= floor(n/2)).

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 3
5 2
6 10
7 4
8 1
9 35
10 14
11 3
12 139
13 54
14 9
15 1
16 611
17 224
18 38
19 4
20 2925
21 1027
22 171
23 16
24 1
25 15128
26 5112
27 822
28 80
29 5
30 83903
31 27352
32 4279
33 415
34 25
35 1
36 495929
37 156392
38 23826
39 2272
40 145
41 6
42 3108129
43 950285
44 141039
45 13252
46 855
47 36
48 1
49 20565721
50 6107540
51 883982
52 81692
53 5257
54 238
55 7

List of values

[1, 1, 1, 1, 3, 2, 10, 4, 1, 35, 14, 3, 139, 54, 9, 1, 611, 224, 38, 4, 2925, 1027, 171, 16, 1, 15128, 5112, 822, 80, 5, 83903, 27352, 4279, 415, 25, 1, 495929, 156392, 23826, 2272, 145, 6, 3108129, 950285, 141039, 13252, 855, 36, 1, 20565721, 6107540, 883982, 81692, 5257, 238, 7]