A308776 - cp's OEIS frontend

A308776 Counterclockwise square spiral of distinct positive integers constructed by greedy algorithm, such that for k = 1..5, every term equal to k mod 5 (except k itself) is vertically or horizontally adjacent to a cell already holding a value equal to k mod 5.

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

[1, 2, 3, 4, 5, 6, 11, 16, 7, 12, 17, 8, 13, 18, 9, 10, 15, 20, 21, 26, 31, 36, 41, 22, 27, 32, 37, 42, 23, 28, 33, 38, 43, 14, 19, 24, 29, 25, 30, 35, 40, 45, 50, 46, 51, 56, 47, 52, 57, 62, 67, 72, 77, 48, 53, 58, 63, 68, 73, 78, 34, 39, 44, 49, 54, 59, 55]

cp's OEIS Frontend

A308776 Counterclockwise square spiral of distinct positive integers constructed by greedy algorithm, such that for k = 1..5, every term equal to k mod 5 (except k itself) is vertically or horizontally adjacent to a cell already holding a value equal to k mod 5.

Table of values

List of values

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

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

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