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.

A368054 Irregular triangle read by rows: T(n,k) is the number of k-crossing partitions on 2n nodes, where all partition terms alternate in parity, counted up to reflection.

Table of values

n a(n)
0 1
1 1
2 3
3 0
4 1
5 14
6 0
7 8
8 10
9 2
10 2
11 81
12 0
13 59
14 162
15 70
16 66
17 82
18 22
19 19
20 6
21 7
22 0
23 2
24 538
25 0
26 454
27 1952
28 1229
29 1208
30 2516
31 1803
32 1181
33 1148
34 998
35 478
36 370
37 279
38 125
39 76
40 26
41 13
42 3
43 3
44 3926
45 0
46 3658
47 21608
48 17083
49 17811
50 48542
51 51306
52 40081
53 51660
54 59023
55 42327

List of values

[1, 1, 3, 0, 1, 14, 0, 8, 10, 2, 2, 81, 0, 59, 162, 70, 66, 82, 22, 19, 6, 7, 0, 2, 538, 0, 454, 1952, 1229, 1208, 2516, 1803, 1181, 1148, 998, 478, 370, 279, 125, 76, 26, 13, 3, 3, 3926, 0, 3658, 21608, 17083, 17811, 48542, 51306, 40081, 51660, 59023, 42327]