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 A128929 #10 Feb 16 2025 08:33:05 %S A128929 1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,6,6,6,6,7,7,7,7,8,8,8,8,9,9,9,9, %T A128929 10,10,10,10,11,11,11,11,12,12,12,12,13,13,13,13,14,14,14,14,15,15,15, %U A128929 15,16,16,16,16,17,17,17,17,18,18,18,18,19,19,19,19,20,20,20,20,21,21,21 %N A128929 Diameter of a special type of regular graph of degree 4 whose order maintain an increase in form of an arithmetic progression. %D A128929 Claude C.S. and Dinneen M.J (1998), Group-theoretic methods for designing networks, Discrete mathematics and theoretical computer science, Research report %D A128929 Comellas, F. and Gomez, J. (1995), New large graphs with given degree and diameter, in Proceedings of the seventh quadrennial international conference on the theory and applications of graphs, Volume 1: pp. 222-233 %D A128929 Ibrahim, A., A. (2007), A stable variety of Cayley graphs (in preparation) %H A128929 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/GraphThickness.html">Graph Thickness</a> %H A128929 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (1, 0, 0, 1, -1). %F A128929 f(D4,5)=1: Order =4,5; f(D)= f(D4,5)+n: order=5+n, n=1,2,... %F A128929 I am assuming this sequence is just Floor[(n+5)/4]... [From _Eric W. Weisstein_, Sep 09 2008] %e A128929 f(D4,5)=1 when order=4, f(D4,5)=1 when order=5, f(D)=f(D4,5)+1=1+1=2 when order is 5+1=6 %Y A128929 Cf. A123642. %Y A128929 First differences of A186347. %K A128929 nonn %O A128929 4,3 %A A128929 _Aminu Alhaji Ibrahim_, Apr 25 2007