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.
%I A185378 #7 Mar 31 2012 10:23:59 %S A185378 1,3,6,15,28,62,120,255,496,1020,2016,4094,8128,16376 %N A185378 Number of binary necklaces of 2n beads that are identical when turned over yet cannot be cut to produce a palindrome. %C A185378 These necklaces have bilateral symmetry across axes that involve only vertices. a(n) = A029744(2n) - A185333(2n). Conjecture: a(n) = 2^n - 2^((n - 2^t)/(2^(t+1))), where t = number of factors of 2 in n. %K A185378 nonn %O A185378 1,2 %A A185378 _Tony Bartoletti_, Feb 20 2011