A104105 - cp's OEIS frontend

A104105 a(1) = 1, if A(k) = sequence of first 2^k -1 terms and if B(k) is A(k) with 0's and 1's exchanged, then A(k+1) = A(k),1,B(k) if a(k) = 0, A(k+1) = A(k),0,B(k) if a(k) = 1.

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

[1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0]

cp's OEIS Frontend

A104105 a(1) = 1, if A(k) = sequence of first 2^k -1 terms and if B(k) is A(k) with 0's and 1's exchanged, then A(k+1) = A(k),1,B(k) if a(k) = 0, A(k+1) = A(k),0,B(k) if a(k) = 1.

Table of values

List of values

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

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

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