%I A027362
%S A027362 1,1,1,2,3,4,7,16,21,48,93,128,315,448,675,2048,3825,5376,13797,24576,
               27783,
%T A027362 95232,182183,262144,629145,1290240,1835001,3670016,9256395,11059200,28629151,
%U A027362 67108864,97327197,250675200,352149525,704643072,1857283155,3616800768
%N A027362 Define a directed graph with 2n nodes {0..2n-1} and edges from each i 
               to 2i (mod 2n) and to 2i+1 (mod 2n); a(n) is number of Hamiltonian 
               cycles.
%C A027362 Also number of binary normal polynomials of degree n. A bijection is 
               given in the "fxtbook". - Joerg Arndt (arndt(AT)jjj.de), Nov 28 2004
%D A027362 Posting to sci.math by jmccaul(AT)iatcmail.ed.ray.com (Joe McCauley).
%H A027362 Joerg Arndt, <a href="b027362.txt">Table of n, a(n) for n = 1..130</a>
%H A027362 Joerg Arndt, <a href="http://www.jjj.de/fxt/#fxtbook">fxtbook</a>
%F A027362 a(n) = A003473(n)/n. - Vladeta Jovovic (vladeta(AT)eunet.rs), Sep 09 
               2003
%e A027362 The solutions for n=1, 2 and 3 are: 0 1; 0 1 3 2; 0 1 2 5 4 3. The 4 
               solutions for n=6 are 0 1 2 4 8 5 11 10 9 7 3 6; 0 1 2 5 11 10 8 
               4 9 7 3 6; 0 1 3 7 2 4 8 5 11 10 9 6; 0 1 3 7 2 5 11 10 8 4 9 6.
%Y A027362 Sequence in context: A098010 A088533 A091155 this_sequence A068194 A134459 
               A110705
%Y A027362 Adjacent sequences: A027359 A027360 A027361 this_sequence A027363 A027364 
               A027365
%K A027362 nonn
%O A027362 1,4
%A A027362 Clone Lester (aflms(AT)cts1.cats.alaska.edu)