The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #16 Mar 02 2024 03:49:39
%S 1,1,2,6,12,48,140,338,926,4390,15990,52766,187688,557768,1772354,
%T 5865806,18707354,102862912,456146172,1833942698,7914142056,
%U 30247599368,120022505534,492976337746,1992746442918,7203060422116,27454886930170,106007544478780,398728610528654
%N Number of permutations of (1, 2, ..., n) in which any two adjacent elements differ by a power of 2.
%C The number of (directed) Hamiltonian paths in the graph with vertex set {1, 2, ..., n} and edges between vertices that differ by a power of 2.
%Y Cf. A076220, A103839, A242519, A367704, A368958.
%K nonn
%O 0,3
%A _Pontus von Brömssen_, Jan 20 2024
%E a(22) from _Alois P. Heinz_, Jan 20 2024
%E a(23) from _Andrew Howroyd_, Jan 20 2024
%E a(24)-a(28) from _Martin Ehrenstein_, Mar 02 2024