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 A371355 #22 Apr 04 2024 10:52:26 %S A371355 0,1,1,1,1,2,2,2,2,2,2,2,2,3,3,3,3,3,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,4, %T A371355 4,4,4,4,4,4,4,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,6,6,6,6,6,6,6, %U A371355 6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7 %N A371355 Minimum diameter of a Cayley graph on the cyclic group Z_n with two generators. %C A371355 Every diameter k>0 occurs 4*k times. %C A371355 See A370461 for the directed case. %H A371355 R. Beivide, E. Herrada, J. L. Balcazar, and A. Arruabarrena, <a href="https://doi.org/10.1109/12.93744">Optimal distance networks of low degree for parallel computers</a>, IEEE Trans. Comput. 40 (1991), no. 10, 1109-1124. %F A371355 a(n) = ceiling((sqrt(2*n-1)-1)/2). %e A371355 For n=26..41 the Cayley graph Cay(n;4,5) (circulant) has diameter a(n)=4. %Y A371355 Cf. A370461. %K A371355 nonn %O A371355 1,6 %A A371355 _Miquel A. Fiol_, Mar 19 2024