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.

A334062 Triangle read by rows: T(n,k) is the number of non-crossing set partitions of {1..4n} into n sets of 4 with k of the sets being a contiguous set of elements.

Table of values

n a(n)
1 1
2 3
3 1
4 9
5 12
6 1
7 27
8 81
9 31
10 1
11 81
12 432
13 390
14 65
15 1
16 243
17 2025
18 3330
19 1365
20 120
21 1
22 729
23 8748
24 22815
25 17415
26 3909
27 203
28 1
29 2187
30 35721
31 135513
32 166320
33 70938
34 9730
35 322
36 1
37 6561
38 139968
39 728028
40 1312038
41 911358
42 242004
43 21816
44 486
45 1
46 19683
47 531441
48 3630420
49 9032310
50 9294264
51 4067658
52 722316
53 45090
54 705
55 1

List of values

[1, 3, 1, 9, 12, 1, 27, 81, 31, 1, 81, 432, 390, 65, 1, 243, 2025, 3330, 1365, 120, 1, 729, 8748, 22815, 17415, 3909, 203, 1, 2187, 35721, 135513, 166320, 70938, 9730, 322, 1, 6561, 139968, 728028, 1312038, 911358, 242004, 21816, 486, 1, 19683, 531441, 3630420, 9032310, 9294264, 4067658, 722316, 45090, 705, 1]