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 A370461 #28 Mar 19 2024 13:40:06 %S A370461 0,1,1,2,2,3,3,3,4,4,4,5,5,5,5,5,6,6,6,7,6,7,7,7,8,7,8,8,8,8,8,9,8,9, %T A370461 9,9,9,9,9,9,10,10,10,10,10,11,10,11,11,11,11,11,12,11,11,11,12,12,12, %U A370461 12,12,13,12,13,12,13,14,13,13,13,13,13,14,13,14,14,14,14,14,14,14,15,14,15,14,15,15,15,16,15,15,15,16,15,15,15,16,16,17,16,16,16,17,17,16,17,16 %N A370461 Minimum diameter of a Cayley digraph on the cyclic group Z_n with two generators. %C A370461 Empirical: For n<>3, the value of a(n) is either floor(sqrt(3n))-1 or floor(sqrt(3n)) (A202304). %H A370461 M. A. Fiol, J. L. A. Yebra, I. Alegre, and M. Valero, <a href="https://doi.org/10.1109/TC.1987.1676963">Discrete optimization problem in local networks and data alignment</a>, IEEE Trans. Comput., C-36 (1987), no. 6, 702-713. %Y A370461 Cf. A202304. %K A370461 nonn %O A370461 1,4 %A A370461 _Miquel A. Fiol_, Mar 18 2024