A095986 - cp's OEIS frontend

A095986 A card-arranging problem: number of permutations p_1, ..., p_n of 1, ..., n such that i + p_i is a square for every i.

n	a(n)
0	1
1	0
2	0
3	1
4	0
5	1
6	0
7	0
8	1
9	1
10	1
11	0
12	1
13	1
14	2
15	4
16	3
17	2
18	5
19	15
20	21
21	66
22	37
23	51
24	144
25	263
26	601
27	1333
28	2119
29	2154
30	2189
31	3280
32	12405
33	55329
34	160895
35	588081
36	849906
37	1258119
38	1233262
39	2478647
40	4305500
41	17278636
42	47424179
43	153686631
44	396952852
45	1043844982

[1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 2, 4, 3, 2, 5, 15, 21, 66, 37, 51, 144, 263, 601, 1333, 2119, 2154, 2189, 3280, 12405, 55329, 160895, 588081, 849906, 1258119, 1233262, 2478647, 4305500, 17278636, 47424179, 153686631, 396952852, 1043844982]

cp's OEIS Frontend

A095986 A card-arranging problem: number of permutations p_1, ..., p_n of 1, ..., n such that i + p_i is a square for every i.

Table of values

List of values