A366800 - cp's OEIS frontend

A366800 Lexicographically earliest infinite sequence such that a(i) = a(j) => A366799(i) = A366799(j) for all i, j >= 0, where A366799 is the number of divisors d of n that are not of the form 4k+2, as permuted by the Doudna sequence.

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

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

cp's OEIS Frontend

A366800 Lexicographically earliest infinite sequence such that a(i) = a(j) => A366799(i) = A366799(j) for all i, j >= 0, where A366799 is the number of divisors d of n that are not of the form 4k+2, as permuted by the Doudna sequence.

Table of values

List of values

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

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

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