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 A282530 #13 Feb 21 2017 01:53:02 %S A282530 0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,27,0,0, %T A282530 0,0,0,0,0,2,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0 %N A282530 Number of finite FRUTE loops of order n up to isomorphism. %C A282530 For a groupoid Q and x in Q, define the right (left) translation map R_x: Q->Q by yR_x=yx (L_x: Q->Q by yL_x=xy). A loop is a groupoid Q with neutral element 1 in which all translations are bijections in Q. A loop Q is called a FRUTE loop if it satisfies the identity (x.xy)z=(y.xz)x for all x, y, z in Q. The smallest associative non-commutative finite FRUTE loop is of order 8, the quaternion group having 8 elements. %H A282530 T. G. Jaiyeola, A. A. Adeniregun and M. A. Asiru, <a href="http://dx.doi.org/10.1142/S0219498817500402">Finite FRUTE loops</a>, Journal of Algebra and its Applications, 16:2(2017), 10 pages. %e A282530 a(8)=2 since there are 2 FRUTE loops of order 8, one of which is the quaternion group of order 8 and a(16)=6 since there are 6 FRUTE loops of order 16. %Y A282530 Cf. A090750, A281319, A281462, A281554 %K A282530 nonn,more %O A282530 1,8 %A A282530 _Muniru A Asiru_, Feb 17 2017