A352730 - cp's OEIS frontend

A352730 On a diagonally numbered square grid, with labels starting at 1, this is the number of steps that a (1,n) leaper makes before getting trapped when moving to the lowest available unvisited square, or -1 if it never gets trapped.

n	a(n)
1	-1
2	2402
3	-1
4	1552
5	287
6	388
7	417
8	1593
9	639
10	1136
11	1785
12	3090
13	2299
14	2341
15	1833
16	4052
17	2237
18	3012
19	3069
20	6843
21	5543
22	3000
23	5161
24	11722
25	6895
26	3578
27	8047
28	19739
29	9671
30	4156
31	8391
32	21424
33	15129
34	4734
35	8609
36	32690
37	19895
38	5312
39	10019
40	42710
41	21195
42	5890
43	12309
44	53764
45	34489
46	6468
47	19527
48	55911
49	23475

[-1, 2402, -1, 1552, 287, 388, 417, 1593, 639, 1136, 1785, 3090, 2299, 2341, 1833, 4052, 2237, 3012, 3069, 6843, 5543, 3000, 5161, 11722, 6895, 3578, 8047, 19739, 9671, 4156, 8391, 21424, 15129, 4734, 8609, 32690, 19895, 5312, 10019, 42710, 21195, 5890, 12309, 53764, 34489, 6468, 19527, 55911, 23475]

cp's OEIS Frontend

A352730 On a diagonally numbered square grid, with labels starting at 1, this is the number of steps that a (1,n) leaper makes before getting trapped when moving to the lowest available unvisited square, or -1 if it never gets trapped.

Table of values

List of values