A010060 - cp's OEIS frontend

A010060 Thue-Morse sequence: let A_k denote the first 2^k terms; then A_0 = 0 and for k >= 0, A_{k+1} = A_k B_k, where B_k is obtained from A_k by interchanging 0's and 1's.

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

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

cp's OEIS Frontend

A010060 Thue-Morse sequence: let A_k denote the first 2^k terms; then A_0 = 0 and for k >= 0, A_{k+1} = A_k B_k, where B_k is obtained from A_k by interchanging 0's and 1's.

Table of values

List of values

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

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

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