A366091 - cp's OEIS frontend

A366091 a(n) is the number of ways to write n = i^2 + 2j^2 + 3k^2 with i,j,k >= 0.

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

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

cp's OEIS Frontend

A366091 a(n) is the number of ways to write n = i^2 + 2j^2 + 3k^2 with i,j,k >= 0.

Table of values

List of values

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

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

cp's OEIS Frontend

A366091 a(n) is the number of ways to write n = i^2 + 2*j^2 + 3*k^2 with i,j,k >= 0.

Table of values

List of values

A366091 a(n) is the number of ways to write n = i^2 + 2j^2 + 3k^2 with i,j,k >= 0.

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