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.

A366354 a(0) = 0; for n > 0, a(n) is the largest taxicab distance on a square spiral between any two previous occurrences 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 4
33 8
34 8
35 9
36 0
37 10
38 0
39 10
40 2
41 7
42 8
43 12
44 0
45 10
46 8
47 12
48 4
49 8
50 12
51 7
52 8
53 12
54 10
55 9
56 6
57 12
58 12
59 12
60 12
61 12
62 12
63 12
64 13
65 0
66 11
67 0
68 11
69 2
70 8
71 12
72 14
73 0
74 11
75 8
76 12
77 14
78 5
79 8
80 12
81 15
82 0
83 15
84 2
85 9
86 10
87 9
88 10
89 11

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, 4, 8, 8, 9, 0, 10, 0, 10, 2, 7, 8, 12, 0, 10, 8, 12, 4, 8, 12, 7, 8, 12, 10, 9, 6, 12, 12, 12, 12, 12, 12, 12, 13, 0, 11, 0, 11, 2, 8, 12, 14, 0, 11, 8, 12, 14, 5, 8, 12, 15, 0, 15, 2, 9, 10, 9, 10, 11]