A154258 - cp's OEIS frontend

A154258 Number of triples such that p+F_s+(F_t)^2=n, where p is an odd prime, s and t are greater than one and the Fibonacci number F_s or F_t is odd.

n	a(n)
1	0
2	0
3	0
4	0
5	1
6	1
7	2
8	2
9	3
10	3
11	2
12	4
13	3
14	5
15	4
16	5
17	6
18	3
19	5
20	6
21	5
22	7
23	4
24	5
25	7
26	4
27	6
28	7
29	6
30	6
31	6
32	5
33	11
34	6
35	8
36	6
37	6
38	7
39	6
40	9
41	9
42	4
43	9
44	5
45	9
46	10
47	6
48	8
49	8
50	7

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

cp's OEIS Frontend

A154258 Number of triples such that p+F_s+(F_t)^2=n, where p is an odd prime, s and t are greater than one and the Fibonacci number F_s or F_t is odd.

Table of values

List of values

n	a(n)
1	0
2	0
3	0
4	0
5	1
6	1
7	2
8	2
9	3
10	3
11	2
12	4
13	3
14	5
15	4
16	5
17	6
18	3
19	5
20	6
21	5
22	7
23	4
24	5
25	7
26	4
27	6
28	7
29	6
30	6
31	6
32	5
33	11
34	6
35	8
36	6
37	6
38	7
39	6
40	9
41	9
42	4
43	9
44	5
45	9
46	10
47	6
48	8
49	8
50	7

n	a(n)
1	0
2	0
3	0
4	0
5	1
6	1
7	2
8	2
9	3
10	3
11	2
12	4
13	3
14	5
15	4
16	5
17	6
18	3
19	5
20	6
21	5
22	7
23	4
24	5
25	7
26	4
27	6
28	7
29	6
30	6
31	6
32	5
33	11
34	6
35	8
36	6
37	6
38	7
39	6
40	9
41	9
42	4
43	9
44	5
45	9
46	10
47	6
48	8
49	8
50	7

n	a(n)
1	0
2	0
3	0
4	0
5	1
6	1
7	2
8	2
9	3
10	3
11	2
12	4
13	3
14	5
15	4
16	5
17	6
18	3
19	5
20	6
21	5
22	7
23	4
24	5
25	7
26	4
27	6
28	7
29	6
30	6
31	6
32	5
33	11
34	6
35	8
36	6
37	6
38	7
39	6
40	9
41	9
42	4
43	9
44	5
45	9
46	10
47	6
48	8
49	8
50	7