A119464 - cp's OEIS frontend

A119464 Consider the standard game of Nim with 3 heaps and make a list of the losing positions (x,y,z) with x <= y <= z sorted by sum, ties broken by putting smallest value of x first, then y, then z; sequence gives x values.

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

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

cp's OEIS Frontend

A119464 Consider the standard game of Nim with 3 heaps and make a list of the losing positions (x,y,z) with x <= y <= z sorted by sum, ties broken by putting smallest value of x first, then y, then z; sequence gives x values.

Table of values

List of values

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

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

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