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.

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

Table of values

n a(n)
2 5
3 5
4 17
5 12
6 14
7 10
8 46
9 37
10 37
11 18
12 122
13 110
14 102
15 52
16 94
17 32
18 330
19 300
20 266
21 145
22 248
23 96
24 888
25 780
26 695
27 385
28 607
29 258
30 602
31 270
32 2347
33 2008
34 1842
35 1001
36 1526
37 663
38 1387
39 669
40 6115
41 5170
42 4840
43 2597
44 3979
45 1718
46 3349
47 1595
48 3076
49 1564
50 15811
51 13288
52 12545
53 6722
54 10331
55 4481
56 8461
57 3925
58 7181
59 3556

List of values

[5, 5, 17, 12, 14, 10, 46, 37, 37, 18, 122, 110, 102, 52, 94, 32, 330, 300, 266, 145, 248, 96, 888, 780, 695, 385, 607, 258, 602, 270, 2347, 2008, 1842, 1001, 1526, 663, 1387, 669, 6115, 5170, 4840, 2597, 3979, 1718, 3349, 1595, 3076, 1564, 15811, 13288, 12545, 6722, 10331, 4481, 8461, 3925, 7181, 3556]