A097082 - cp's OEIS frontend

A097082 Number of permutations p of (1,2,3,...,n) such that k+p(k) is a Fibonacci number for 1 <= k <= n.

n	a(n)
0	1
1	1
2	1
3	1
4	2
5	1
6	2
7	4
8	2
9	1
10	4
11	4
12	20
13	4
14	5
15	1
16	20
17	24
18	8
19	96
20	200
21	24
22	4
23	25
24	1
25	3
26	200
27	48
28	288
29	48
30	64
31	2304
32	1600
33	10800
34	288
35	432
36	8
37	675
38	650
39	1
40	26
41	9
42	10400
43	1600
44	576
45	2304
46	23040
47	576
48	2560
49	1024
50	368640
51	516096
52	128000
53	2240000
54	5832000
55	32256
56	2304
57	46656
58	64
59	96
60	91125
61	3750
62	84500
63	6
64	1
65	676
66	9
67	261

[1, 1, 1, 1, 2, 1, 2, 4, 2, 1, 4, 4, 20, 4, 5, 1, 20, 24, 8, 96, 200, 24, 4, 25, 1, 3, 200, 48, 288, 48, 64, 2304, 1600, 10800, 288, 432, 8, 675, 650, 1, 26, 9, 10400, 1600, 576, 2304, 23040, 576, 2560, 1024, 368640, 516096, 128000, 2240000, 5832000, 32256, 2304, 46656, 64, 96, 91125, 3750, 84500, 6, 1, 676, 9, 261]

cp's OEIS Frontend

A097082 Number of permutations p of (1,2,3,...,n) such that k+p(k) is a Fibonacci number for 1 <= k <= n.

Table of values

List of values