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 A212661 #28 Feb 28 2021 09:52:17 %S A212661 0,0,1,2,4,5,7,9,12,16,20,23,26,30,35,41,48,52,57,63,70,78,87,93 %N A212661 a(n) = smallest number of edges that must be removed from K_n to obtain a graceful graph. %D A212661 G. S. Bloom and S. W. Golomb, Numbered complete graphs, unusual rulers, and assorted applications. Theory and Applications of Graphs, Lecture Notes in Math. 642, (1978), 53-65. %D A212661 Miller, J. C. P. Difference bases. Three problems in additive number theory. Computers in number theory (Proc. Sci. Res. Council Atlas Sympos. No. 2, Oxford, 1969), pp. 299--322. Academic Press, London,1971. MR0316269 (47 #4817) - From _N. J. A. Sloane_, Jun 05 2012 %D A212661 Rhys Price Jones, Gracelessness, Proc. 10th S.-E. Conf. Combin., Graph Theory and Computing, 1979, pp. 547-552. - From _N. J. A. Sloane_, Jun 05 2012 %H A212661 G. S. Bloom and S. W. Golomb, <a href="https://doi.org/10.1109/PROC.1977.10517">Applications of numbered undirected graphs</a>, Proc. IEEE 65 (1977), 562-570. %H A212661 <a href="/index/Go#Golomb">Index entries for sequences related to Golomb rulers</a> %F A212661 n(n-1)/2 = a(n)+A004137(n). - _Kellen Myers_, Jun 06 2016 %Y A212661 Cf. A003022, A078106, A004137. %K A212661 nonn,more %O A212661 3,4 %A A212661 _N. J. A. Sloane_, Jun 05 2012 %E A212661 a(26) using extension of A004137 from _Hugo Pfoertner_, Feb 28 2021