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.

A213954 Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths starting at each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 3, n >= 2.

Table of values

n a(n)
2 3
3 4
4 8
5 6
6 6
7 8
8 17
9 14
10 12
11 10
12 36
13 32
14 25
15 18
16 20
17 12
18 77
19 68
20 51
21 36
22 38
23 20
24 164
25 142
26 106
27 72
28 72
29 38
30 64
31 28
32 347
33 298
34 225
35 146
36 142
37 74
38 109
39 46
40 732
41 628
42 476
43 302
44 294
45 148
46 197
47 82
48 168
49 64
50 1543
51 1324
52 1003
53 632
54 614
55 304
56 385
57 156
58 277
59 100
60 3252
61 2790
62 2112
63 1328
64 1284
65 634
66 777
67 312
68 504
69 174
70 414
71 136

List of values

[3, 4, 8, 6, 6, 8, 17, 14, 12, 10, 36, 32, 25, 18, 20, 12, 77, 68, 51, 36, 38, 20, 164, 142, 106, 72, 72, 38, 64, 28, 347, 298, 225, 146, 142, 74, 109, 46, 732, 628, 476, 302, 294, 148, 197, 82, 168, 64, 1543, 1324, 1003, 632, 614, 304, 385, 156, 277, 100, 3252, 2790, 2112, 1328, 1284, 634, 777, 312, 504, 174, 414, 136]