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.

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

Table of values

n a(n)
2 52
3 0
4 0
5 0
6 353
7 57
8 62
9 60
10 10
11 0
12 0
13 0
14 1931
15 495
16 622
17 602
18 200
19 56
20 262
21 364
22 12027
23 3522
24 4399
25 4170
26 2143
27 640
28 1941
29 2394
30 2612
31 954
32 3956
33 5136
34 76933
35 21068
36 26181
37 25090
38 17601
39 3675
40 9258
41 10048
42 20009
43 7213
44 26414
45 32132

List of values

[52, 0, 0, 0, 353, 57, 62, 60, 10, 0, 0, 0, 1931, 495, 622, 602, 200, 56, 262, 364, 12027, 3522, 4399, 4170, 2143, 640, 1941, 2394, 2612, 954, 3956, 5136, 76933, 21068, 26181, 25090, 17601, 3675, 9258, 10048, 20009, 7213, 26414, 32132]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.