Svoboda | Graniru | BBC Russia | Golosameriki | Facebook
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A007036 Number of 1-supertough but non-1-Hamiltonian simplicial polyhedra with n nodes.
(Formerly M3990)
0

%I M3990 #10 Sep 27 2017 16:09:33

%S 0,0,0,0,0,0,0,0,0,1,5,40,343,2979,25950,224773

%N Number of 1-supertough but non-1-Hamiltonian simplicial polyhedra with n nodes.

%D M. B. Dillencourt, Polyhedra of small orders and their Hamiltonian properties. Tech. Rep. 92-91, Info. and Comp. Sci. Dept., Univ. Calif. Irvine, 1992.

%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

%K nonn,hard

%O 1,11

%A _N. J. A. Sloane_.

%E a(15)-a(16) from _Sean A. Irvine_, Sep 27 2017

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 6 10:27 EDT 2024. Contains 374969 sequences. (Running on oeis4.)