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.

A343530 Number of steps before being trapped for a knight moving on a square-spiral base-n numbered board when stepping to the closest unvisited square which contains a number that shares no digit with the number of the current square. If two or more such squares are the same distance away the one with the smaller number is chosen.

Table of values

n a(n)
2 0
3 1
4 12
5 10
6 13
7 16
8 35
9 51
10 56
11 90
12 42
13 84
14 99
15 129
16 156
17 30
18 220
19 184
20 201
21 79
22 321
23 25
24 424
25 301
26 389
27 29
28 32
29 311
30 328
31 186
32 129
33 42
34 101
35 97
36 144
37 52
38 534
39 83
40 506
41 885
42 233
43 472
44 43
45 410
46 145
47 210
48 482
49 51
50 57
51 144
52 53
53 60
54 148
55 248
56 83
57 80
58 180
59 72
60 55

List of values

[0, 1, 12, 10, 13, 16, 35, 51, 56, 90, 42, 84, 99, 129, 156, 30, 220, 184, 201, 79, 321, 25, 424, 301, 389, 29, 32, 311, 328, 186, 129, 42, 101, 97, 144, 52, 534, 83, 506, 885, 233, 472, 43, 410, 145, 210, 482, 51, 57, 144, 53, 60, 148, 248, 83, 80, 180, 72, 55]