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.

A214119 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 2, n >= 2.

Table of values

n a(n)
2 2
3 5
4 0
5 10
6 0
7 18
8 0
9 0
10 31
11 0
12 0
13 52
14 0
15 0
16 0
17 86
18 0
19 0
20 0
21 141
22 0
23 0
24 0
25 0
26 230
27 0
28 0
29 0
30 0
31 374
32 0
33 0
34 0
35 0
36 0
37 607
38 0
39 0
40 0
41 0
42 0
43 984
44 0
45 0
46 0
47 0
48 0
49 0
50 1594
51 0
52 0
53 0
54 0
55 0
56 0
57 2581
58 0
59 0
60 0
61 0
62 0
63 0
64 0
65 4178
66 0
67 0
68 0
69 0
70 0
71 0
72 0
73 6762
74 0
75 0
76 0
77 0
78 0
79 0

List of values

[2, 5, 0, 10, 0, 18, 0, 0, 31, 0, 0, 52, 0, 0, 0, 86, 0, 0, 0, 141, 0, 0, 0, 0, 230, 0, 0, 0, 0, 374, 0, 0, 0, 0, 0, 607, 0, 0, 0, 0, 0, 984, 0, 0, 0, 0, 0, 0, 1594, 0, 0, 0, 0, 0, 0, 2581, 0, 0, 0, 0, 0, 0, 0, 4178, 0, 0, 0, 0, 0, 0, 0, 6762, 0, 0, 0, 0, 0, 0]