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.

A325754 Triangle read by rows giving the number of configurations of n indistinguishable pairs placed on the vertices of the ladder graph P_2 X P_n such that exactly k such pairs are joined by a horizontal edge.

Table of values

n a(n)
0 1
1 1
2 0
3 2
4 0
5 1
6 7
7 4
8 4
9 0
10 43
11 38
12 21
13 2
14 1
15 372
16 360
17 168
18 36
19 9
20 0
21 4027
22 3972
23 1818
24 478
25 93
26 6
27 1
28 51871
29 51444
30 23760
31 6640
32 1260
33 144
34 16
35 0
36 773186
37 768732
38 358723
39 103154
40 20205
41 2734
42 278
43 12
44 1
45 13083385
46 13027060
47 6129670
48 1796740
49 363595
50 52900
51 5650
52 400
53 25
54 0

List of values

[1, 1, 0, 2, 0, 1, 7, 4, 4, 0, 43, 38, 21, 2, 1, 372, 360, 168, 36, 9, 0, 4027, 3972, 1818, 478, 93, 6, 1, 51871, 51444, 23760, 6640, 1260, 144, 16, 0, 773186, 768732, 358723, 103154, 20205, 2734, 278, 12, 1, 13083385, 13027060, 6129670, 1796740, 363595, 52900, 5650, 400, 25, 0]