A317922 - cp's OEIS frontend

A317922 a(n) = number of k with 0 < 2k < n-1 such that a(n-k) AND a(n-2k) = a(n-k) (where AND denotes the bitwise AND operator).

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

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

cp's OEIS Frontend

A317922 a(n) = number of k with 0 < 2k < n-1 such that a(n-k) AND a(n-2k) = a(n-k) (where AND denotes the bitwise AND operator).

Table of values

List of values

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

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

cp's OEIS Frontend

A317922 a(n) = number of k with 0 < 2*k < n-1 such that a(n-k) AND a(n-2*k) = a(n-k) (where AND denotes the bitwise AND operator).

Table of values

List of values

A317922 a(n) = number of k with 0 < 2k < n-1 such that a(n-k) AND a(n-2k) = a(n-k) (where AND denotes the bitwise AND operator).

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