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.

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

This page as a plain text file.
%I A369330 #16 Mar 02 2024 03:49:39
%S A369330 1,1,2,6,12,48,140,338,926,4390,15990,52766,187688,557768,1772354,
%T A369330 5865806,18707354,102862912,456146172,1833942698,7914142056,
%U A369330 30247599368,120022505534,492976337746,1992746442918,7203060422116,27454886930170,106007544478780,398728610528654
%N A369330 Number of permutations of (1, 2, ..., n) in which any two adjacent elements differ by a power of 2.
%C A369330 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 A369330 Cf. A076220, A103839, A242519, A367704, A368958.
%K A369330 nonn
%O A369330 0,3
%A A369330 _Pontus von Brömssen_, Jan 20 2024
%E A369330 a(22) from _Alois P. Heinz_, Jan 20 2024
%E A369330 a(23) from _Andrew Howroyd_, Jan 20 2024
%E A369330 a(24)-a(28) from _Martin Ehrenstein_, Mar 02 2024