A306383 - cp's OEIS frontend

A306383 Number of ways to write n as x(2x+1) + y(2y+1) + z*(2z+1), where x,y,z are nonnegative integers with x <= y <= z.

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

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

cp's OEIS Frontend

A306383 Number of ways to write n as x(2x+1) + y(2y+1) + z*(2z+1), where x,y,z are nonnegative integers with x <= y <= z.

Table of values

List of values

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

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

cp's OEIS Frontend

A306383 Number of ways to write n as x*(2x+1) + y*(2y+1) + z*(2z+1), where x,y,z are nonnegative integers with x <= y <= z.

Table of values

List of values

A306383 Number of ways to write n as x(2x+1) + y(2y+1) + z*(2z+1), where x,y,z are nonnegative integers with x <= y <= z.

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