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.

A341770 Largest number m on the square spiral board such that it takes n steps to reach square 1 from square m along the shortest path without stepping on any prime number.

Table of values

n a(n)
0 1
1 8
2 23
3 34
4 61
5 62
6 97
7 138
8 189
9 248
10 315
11 390
12 473
13 564
14 663
15 770
16 885
17 1008
18 1139
19 1278
20 1425
21 1580
22 1743
23 1914
24 2093
25 2280
26 2475
27 2678
28 2889
29 3108
30 3335
31 3570
32 3813
33 4064
34 4323
35 4590
36 4865
37 5148
38 5439
39 5738
40 6045
41 6360
42 6683
43 7014
44 7353
45 7700
46 8055
47 8418

List of values

[1, 8, 23, 34, 61, 62, 97, 138, 189, 248, 315, 390, 473, 564, 663, 770, 885, 1008, 1139, 1278, 1425, 1580, 1743, 1914, 2093, 2280, 2475, 2678, 2889, 3108, 3335, 3570, 3813, 4064, 4323, 4590, 4865, 5148, 5439, 5738, 6045, 6360, 6683, 7014, 7353, 7700, 8055, 8418]