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.

A328894 a(n) is the number of steps before being trapped for a knight starting on square n on a single-digit square-spiral numbered board and where the knight moves to the smallest numbered unvisited square; the minimum distance from the origin is used if the square numbers are equal; the smallest spiral number ordering is used if the distances are equal.

Table of values

n a(n)
1 1069
2 884
3 995
4 884
5 885
6 988
7 885
8 943
9 549
10 1070
11 942
12 548
13 881
14 951
15 987
16 886
17 661
18 601
19 1123
20 1313
21 1034
22 1070
23 1101
24 1070
25 1930
26 943
27 655
28 882
29 1930
30 943
31 1471
32 992
33 583
34 884
35 806
36 704
37 1062
38 1098
39 1096
40 1129
41 1174
42 723
43 438
44 1102
45 854

List of values

[1069, 884, 995, 884, 885, 988, 885, 943, 549, 1070, 942, 548, 881, 951, 987, 886, 661, 601, 1123, 1313, 1034, 1070, 1101, 1070, 1930, 943, 655, 882, 1930, 943, 1471, 992, 583, 884, 806, 704, 1062, 1098, 1096, 1129, 1174, 723, 438, 1102, 854]

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

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