A226005 - cp's OEIS frontend

A226005 Lexicographically earliest sequence such that (a(n), a(n+1)) runs through all the pairs of nonnegative integers exactly once, with the constraint that a(n)=0 iff n is a square.

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

[0, 0, 1, 1, 0, 2, 1, 2, 2, 0, 3, 1, 3, 2, 3, 3, 0, 4, 1, 4, 2, 4, 3, 4, 4, 0, 5, 1, 5, 2, 5, 3, 5, 4, 5, 5, 0, 6, 1, 6, 2, 6, 3, 6, 4, 6, 5, 6, 6, 0, 7, 1, 7, 2, 7, 3, 7, 4, 7, 5, 7, 6, 7, 7, 0, 8, 1, 8, 2, 8, 3, 8, 4, 8, 5, 8, 6, 8, 7, 8, 8, 0, 9, 1, 9, 2, 9, 3, 9, 4, 9, 5, 9, 6, 9, 7, 9, 8, 9, 9, 0]

cp's OEIS Frontend

A226005 Lexicographically earliest sequence such that (a(n), a(n+1)) runs through all the pairs of nonnegative integers exactly once, with the constraint that a(n)=0 iff n is a square.

Table of values

List of values

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

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

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