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.

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

Table of values

n a(n)
0 1
1 1
2 2
3 4
4 1
5 13
6 2
7 46
8 6
9 184
10 18
11 1
12 805
13 69
14 3
15 3840
16 288
17 12
18 19775
19 1324
20 47
21 1
22 109180
23 6578
24 213
25 4
26 642382
27 35136
28 1032
29 20
30 4007712
31 200398
32 5390
33 96
34 1
35 26399764
36 1214136
37 30027
38 505
39 5
40 182939900
41 7778856
42 177744
43 2792
44 30
45 1329327991
46 52501052
47 1112969
48 16362
49 170
50 1

List of values

[1, 1, 2, 4, 1, 13, 2, 46, 6, 184, 18, 1, 805, 69, 3, 3840, 288, 12, 19775, 1324, 47, 1, 109180, 6578, 213, 4, 642382, 35136, 1032, 20, 4007712, 200398, 5390, 96, 1, 26399764, 1214136, 30027, 505, 5, 182939900, 7778856, 177744, 2792, 30, 1329327991, 52501052, 1112969, 16362, 170, 1]