Number of cyclic arrangements (up to direction) of {1,2,...,n} such that the difference between any two neighbors is b^k for some b>1 and k>1.

A242521

Number of cyclic arrangements (up to direction) of {1,2,...,n} such that the difference between any two neighbors is b^k for some b>1 and k>1.

Terms

    a(0) =0a(1) =0a(2) =0a(3) =0a(4) =0a(5) =0a(6) =0a(7) =0a(8) =0a(9) =0a(10) =0a(11) =0a(12) =2a(13) =4a(14) =6a(15) =9a(16) =42a(17) =231a(18) =1052a(19) =3818a(20) =10086a(21) =27892a(22) =90076a(23) =310301a(24) =993680a(25) =4663558a(26) =22038882a(27) =162588454a(28) =1246422151a(29) =8655752023

External references