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

Terms

a(0) =1a(1) =1a(2) =1a(3) =1a(4) =2a(5) =1a(6) =2a(7) =4a(8) =2a(9) =1a(10) =4a(11) =4a(12) =20a(13) =4a(14) =5a(15) =1a(16) =20a(17) =24a(18) =8a(19) =96a(20) =200a(21) =24a(22) =4a(23) =25a(24) =1a(25) =3a(26) =200a(27) =48a(28) =288a(29) =48