Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
editing
approved
A. Iványi, L. Lucz, T. Matuszka and S. Pirzada, <a href="httphttps://www.acta.sapientia.ro/acta-infoen/series/informatica/publications/C4informatica-contents-of-volume-4-number-2-2012/info42parallel-enumeration-of-degree-sequences-of-simple-7.pdfgraphs">Parallel enumeration of degree sequences of simple graphs</a>, Acta Univ. Sapiantiae, Inform.4 (2) (2012) 260-288.
approved
editing
Paul Balister, Serte Donderwinkel, Carla Groenland, Tom Johnston, and Alex Scott, <a href="/A095268/b095268_3.txt">Table of n, a(n) for n = 0..1651</a> (terms 0 through 79 from Kai Wang)
reviewed
approved
proposed
reviewed
editing
proposed
Paul Balister, Serte Donderwinkel, Carla Groenland, Tom Johnston, and Alex Scott, <a href="/A095268/b095268_3.txt">Table of n, a(n) for n = 0..1651</a> (Terms terms 0 through 79 by from Kai Wang)
proposed
editing
editing
proposed
The asymptotic formula given below confirms that a(n+1)/a(n) tends to 4. - Tom Johnston, Jan 18 2023
Kai Wang, Paul Balister, Serte Donderwinkel, Carla Groenland, Tom Johnston, and Alex Scott, <a href="/A095268/b095268_3.txt">Table of n, a(n) for n = 0..1651</a> (Terms 0 through 79</a> by Kai Wang)
a(n) ~ c * 4^n / n^(3/4) for some c > 0. Computational estimates suggest c ≈ 0.074321. - Tom Johnston, Jan 18 2023
approved
editing
reviewed
approved