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.

A335585 The numbers visited on a square spiral, with a(n) = n for 1 <= n <= 3, when stepping to an unvisited number as close as possible to the n = 1 starting position that has at least one common factor with the second last visited number but none with the last visited number. In case of a tie, choose the smallest number.

Table of values

n a(n)
1 1
2 2
3 3
4 4
5 9
6 8
7 15
8 14
9 5
10 6
11 25
12 12
13 35
14 16
15 7
16 10
17 21
18 20
19 27
20 22
21 39
22 11
23 18
24 77
25 24
26 49
27 34
28 63
29 17
30 28
31 51
32 40
33 33
34 46
35 45
36 23
37 30
38 161
39 26
40 69
41 13
42 36
43 65
44 32
45 55
46 38
47 75
48 19
49 42
50 95
51 44
52 85
53 48
54 115
55 52
56 105
57 62
58 87
59 68
60 29
61 54
62 203
63 60
64 119
65 76
66 153
67 70
68 117
69 50
70 57
71 56
72 81
73 58
74 93

List of values

[1, 2, 3, 4, 9, 8, 15, 14, 5, 6, 25, 12, 35, 16, 7, 10, 21, 20, 27, 22, 39, 11, 18, 77, 24, 49, 34, 63, 17, 28, 51, 40, 33, 46, 45, 23, 30, 161, 26, 69, 13, 36, 65, 32, 55, 38, 75, 19, 42, 95, 44, 85, 48, 115, 52, 105, 62, 87, 68, 29, 54, 203, 60, 119, 76, 153, 70, 117, 50, 57, 56, 81, 58, 93]