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.

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

Table of values

n a(n)
2 8
3 7
4 6
5 36
6 25
7 20
8 32
9 18
10 12
11 122
12 102
13 94
14 110
15 52
16 32
17 436
18 395
19 394
20 395
21 220
22 154
23 394
24 154
25 80
26 1580
27 1414
28 1402
29 1381
30 813
31 596
32 1365
33 652
34 432
35 5600
36 4829
37 4650
38 4795
39 2792
40 2036
41 4453
42 2285
43 1712
44 4412
45 2556
46 2248
47 19287
48 16131
49 15246
50 16735
51 9444
52 6758
53 15113
54 7697
55 5858
56 13878
57 8612
58 8496

List of values

[8, 7, 6, 36, 25, 20, 32, 18, 12, 122, 102, 94, 110, 52, 32, 436, 395, 394, 395, 220, 154, 394, 154, 80, 1580, 1414, 1402, 1381, 813, 596, 1365, 652, 432, 5600, 4829, 4650, 4795, 2792, 2036, 4453, 2285, 1712, 4412, 2556, 2248, 19287, 16131, 15246, 16735, 9444, 6758, 15113, 7697, 5858, 13878, 8612, 8496]