A369330 Number of permutations of (1, 2, ..., n) in which any two adjacent elements differ by a power of 2.

1, 1, 2, 6, 12, 48, 140, 338, 926, 4390, 15990, 52766, 187688, 557768, 1772354, 5865806, 18707354, 102862912, 456146172, 1833942698, 7914142056, 30247599368, 120022505534, 492976337746, 1992746442918, 7203060422116, 27454886930170, 106007544478780, 398728610528654

Offset

0,3

Comments

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.

Links

Table of n, a(n) for n=0..28.

Crossrefs

Cf. A076220, A103839, A242519, A367704, A368958.

Sequence in context: A169858 A292132 A208147 * A152873 A175810 A083001

Adjacent sequences: A369327 A369328 A369329 * A369331 A369332 A369333

Keyword

nonn

Author

Pontus von Brömssen, Jan 20 2024

Extensions

a(22) from Alois P. Heinz, Jan 20 2024

a(23) from Andrew Howroyd, Jan 20 2024

a(24)-a(28) from Martin Ehrenstein, Mar 02 2024

Status

approved