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.

A323749 Triangle read by rows: T(n,m) (1 <= n < m) = number of moves of a (m,n)-leaper (a generalization of a chess knight) until it can no longer move, starting on a board with squares spirally numbered from 1. Each move is to the lowest-numbered unvisited square. T(n,m) = -1 if the path never terminates.

Table of values

n a(n)
1 2016
2 3723
3 4634
4 13103
5 2016
6 1888
7 14570
8 7574
9 1323
10 4286
11 26967
12 3723
13 2016
14 4634
15 1796
16 101250
17 12217
18 4683
19 9386
20 1811
21 3487
22 158735
23 13103
24 5974
25 2016
26 2758
27 1888
28 3984
29 132688
30 33864
31 3723
32 8900
33 6513
34 4634
35 4505
36 7796
37 220439
38 14570
39 36232
40 7574
41 2016
42 1323
43 9052
44 4286
45 5679
46 144841
47 52738
48 19370
49 6355
50 6425

List of values

[2016, 3723, 4634, 13103, 2016, 1888, 14570, 7574, 1323, 4286, 26967, 3723, 2016, 4634, 1796, 101250, 12217, 4683, 9386, 1811, 3487, 158735, 13103, 5974, 2016, 2758, 1888, 3984, 132688, 33864, 3723, 8900, 6513, 4634, 4505, 7796, 220439, 14570, 36232, 7574, 2016, 1323, 9052, 4286, 5679, 144841, 52738, 19370, 6355, 6425]

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

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