cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-1 of 1 results.

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

Original entry on oeis.org

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

Views

Author

Pontus von Brömssen, Jan 20 2024

Keywords

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.

Crossrefs

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

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
Showing 1-1 of 1 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.