reviewed

approved

proposed

reviewed

editing

proposed

H. Haanpaa and Patric R. J. Östergård, <a href="http://dx.doi.org/10.1090/S0025-5718-2013-02741-X">Counting Hamiltonian cycles in bipartite graphs, </a>, Math. Comp. 83 (2014), 979-995. doi:<a href="http://dx.doi.org/10.1090/S0025-5718-2013-02741-X">S0025-5718-2013-02741-X</a>

Michel Deza and Roman Shklyar, <a href="http://arxiv.org/abs/1003.4391">Enumeration of Hamiltonian Cycles in 6-cube</a>, arXiv:1003.4391v1 4391 [cs.DM], 2010. [There may be errors - see Haanpaa and Ostergard, 2012]

D. Sensarma, S. S. Sarma, <a href="https://doi.org/10.15623/IJRET.2014.0303121">GMDES: A graph based modified Data Encryption Standard algorithm with enhanced security</a>, IJRET: International Journal of Research in Engineering and Technology 03:03 (2014), 653-660. See Section 2.2.

D. Sensarma, S. S. Sarma, <a href="https://doi.org/10.15623/IJRET.2014.0303121">GMDES: A graph based modified Data Encryption Standard algorithm with enhanced security</a>, IJRET: International Journal of Research in Engineering and Technology 03:03 (2014), 653-660. See Section 2.2.

proposed

editing

editing

proposed

D. Sensarma, S. S. Sarma, <a href="httphttps://ijretdoi.org/Volumes/V03/I0310.15623/IJRET_110303121.pdf2014.0303121">GMDES: A graph based modified Data Encryption Standard algorithm with enhanced security</a>, IJRET: International Journal of Research in Engineering and Technology 03:03 (2014), 653-660. See Section 2.2.

approved

editing

proposed

approved

editing

proposed

H. Haanpaa and P. Patric R. J. Ostergard, Östergård, Counting Hamiltonian cycles in bipartite graphs, Math. Comp. 83 (2014), 979-995. doi:<a href="http://dx.doi.org/10.1090/S0025-5718-2013-02741-X">S0025-5718-2013-02741-X</a>

a(n) = A003042(n)*2^n. - _Max Alekseyev, _, Jun 15 2006

a(6) corrected by Haanpaa and Ostergard, Östergård, 2012. - N. J. A. Sloane, Sep 06 2012

approved

editing