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.

A214121 Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths ending 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 5
3 0
4 14
5 2
6 2
7 0
8 33
9 4
10 6
11 0
12 75
13 6
14 13
15 0
16 16
17 0
18 165
19 8
20 27
21 0
22 32
23 0
24 353
25 10
26 57
27 0
28 62
29 0
30 60
31 0
32 747
33 12
34 119
35 0
36 124
37 0
38 109
39 0
40 1577
41 14
42 247
43 0
44 250
45 0
46 206
47 0
48 184
49 0
50 3327
51 16
52 515
53 0
54 508
55 0
56 399
57 0
58 323
59 0
60 7015
61 18
62 1079
63 0
64 1046
65 0
66 790
67 0
68 590

List of values

[5, 0, 14, 2, 2, 0, 33, 4, 6, 0, 75, 6, 13, 0, 16, 0, 165, 8, 27, 0, 32, 0, 353, 10, 57, 0, 62, 0, 60, 0, 747, 12, 119, 0, 124, 0, 109, 0, 1577, 14, 247, 0, 250, 0, 206, 0, 184, 0, 3327, 16, 515, 0, 508, 0, 399, 0, 323, 0, 7015, 18, 1079, 0, 1046, 0, 790, 0, 590]