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.

A271617 T(n,k) = Number of ways to reciprocally link elements of an n X n X n triangular array with themselves or a neighbor, with no more than k elements linked to themselves.

Table of values

n a(n)
1 1
2 1
3 3
4 1
5 3
6 2
7 1
8 4
9 17
10 6
11 1
12 4
13 17
14 114
15 240
16 1
17 4
18 26
19 114
20 240
21 2238
22 1
23 4
24 26
25 307
26 2571
27 2238
28 2196
29 1
30 4
31 27
32 307
33 2571
34 42702
35 216318
36 37004
37 1
38 4
39 27
40 406
41 7764
42 42702
43 216318
44 5622392
45 20454036
46 1
47 4
48 27
49 406
50 7764
51 222936
52 3243689
53 5622392
54 20454036
55 970623228

List of values

[1, 1, 3, 1, 3, 2, 1, 4, 17, 6, 1, 4, 17, 114, 240, 1, 4, 26, 114, 240, 2238, 1, 4, 26, 307, 2571, 2238, 2196, 1, 4, 27, 307, 2571, 42702, 216318, 37004, 1, 4, 27, 406, 7764, 42702, 216318, 5622392, 20454036, 1, 4, 27, 406, 7764, 222936, 3243689, 5622392, 20454036, 970623228]