A303639 - cp's OEIS frontend

A303639 Number of ways to write n as a^2 + b^2 + binomial(2c+1,c) + binomial(2d+1,d), where a,b,c,d are nonnegative integers with a <= b and c <= d.

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

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

cp's OEIS Frontend

A303639 Number of ways to write n as a^2 + b^2 + binomial(2c+1,c) + binomial(2d+1,d), where a,b,c,d are nonnegative integers with a <= b and c <= d.

Table of values

List of values

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

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

cp's OEIS Frontend

A303639 Number of ways to write n as a^2 + b^2 + binomial(2*c+1,c) + binomial(2*d+1,d), where a,b,c,d are nonnegative integers with a <= b and c <= d.

Table of values

List of values

A303639 Number of ways to write n as a^2 + b^2 + binomial(2c+1,c) + binomial(2d+1,d), where a,b,c,d are nonnegative integers with a <= b and c <= d.

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