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.

A366353 a(0) = 0; for n > 0, a(n) is the largest taxicab distance on a square spiral between a(n-1) and any previous occurrence of a(n-1). If a(n-1) has not previously occurred then a(n) = 0.

Table of values

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

List of values

[0, 0, 1, 0, 2, 0, 2, 2, 3, 0, 4, 0, 4, 2, 5, 0, 6, 0, 6, 2, 6, 4, 7, 0, 6, 8, 0, 7, 5, 4, 8, 5, 3, 4, 6, 8, 10, 0, 9, 0, 7, 7, 8, 12, 0, 7, 6, 8, 10, 12, 6, 10, 11, 0, 9, 8, 13, 0, 11, 6, 9, 6, 11, 10, 13, 8, 12, 13, 11, 10, 9, 12, 8, 15, 0, 13, 13, 12, 11, 12, 13, 16, 0, 13, 15, 11, 11, 10, 12]