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.

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

Table of values

n a(n)
2 2
3 3
4 4
5 5
6 5
7 8
8 7
9 6
10 13
11 10
12 8
13 21
14 15
15 11
16 10
17 34
18 23
19 16
20 13
21 55
22 36
23 24
24 18
25 16
26 89
27 57
28 37
29 26
30 21
31 144
32 91
33 58
34 39
35 29
36 26
37 233
38 146
39 92
40 60
41 42
42 34
43 377
44 235
45 147
46 94
47 63
48 47
49 42
50 610
51 379
52 236
53 149
54 97
55 68
56 55
57 987
58 612
59 380
60 238
61 152
62 102
63 76
64 68
65 1597
66 989
67 613
68 382
69 241
70 157
71 110
72 89

List of values

[2, 3, 4, 5, 5, 8, 7, 6, 13, 10, 8, 21, 15, 11, 10, 34, 23, 16, 13, 55, 36, 24, 18, 16, 89, 57, 37, 26, 21, 144, 91, 58, 39, 29, 26, 233, 146, 92, 60, 42, 34, 377, 235, 147, 94, 63, 47, 42, 610, 379, 236, 149, 97, 68, 55, 987, 612, 380, 238, 152, 102, 76, 68, 1597, 989, 613, 382, 241, 157, 110, 89]