A096904 - cp's OEIS frontend

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

n	a(n)
1	0
2	0
3	0
4	0
5	0
6	0
7	1
8	0
9	0
10	0
11	0
12	0
13	0
14	0
15	0
16	0
17	0
18	0
19	1
20	0
21	0
22	0
23	0
24	0
25	0
26	1
27	0
28	0
29	0
30	0
31	0
32	0
33	0
34	0
35	0
36	0
37	1
38	0
39	0
40	0
41	0
42	0
43	0
44	1
45	0
46	0
47	0
48	0
49	0
50	0
51	0
52	0
53	0
54	0
55	0
56	1
57	0
58	0
59	0
60	0
61	0
62	0
63	1
64	0
65	0
66	1
67	0
68	1
69	0
70	0
71	0
72	0
73	0
74	0
75	0
76	0
77	0
78	0
79	0
80	1
81	0
82	1
83	0
84	0
85	1
86	0
87	1
88	0
89	0
90	0
91	0
92	0
93	0
94	0
95	0
96	0
97	0
98	1
99	0
100	1
101	0
102	0
103	1
104	0
105	1
106	0
107	0
108	0
109	0
110	1
111	0
112	4
113	0
114	0
115	4
116	4
117	5
118	1
119	2
120	1
121	1
122	1
123	1
124	2
125	3
126	7
127	3
128	10
129	6
130	5
131	1
132	1
133	4
134	0
135	1
136	0
137	0
138	0
139	0
140	0
141	0
142	0
143	0
144	0
145	0
146	0
147	1
148	0
149	1
150	1
151	1
152	1
153	0
154	0
155	1
156	1
157	0
158	0
159	1
160	0
161	0
162	0
163	0
164	0
165	0
166	0
167	0
168	0
169	0
170	0
171	1
172	0
173	1
174	1
175	3
176	30
177	37
178	1963
179	1289
180	1560

[0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 4, 0, 0, 4, 4, 5, 1, 2, 1, 1, 1, 1, 2, 3, 7, 3, 10, 6, 5, 1, 1, 4, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 3, 30, 37, 1963, 1289, 1560]

cp's OEIS Frontend

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

Table of values

List of values