%I A095268
%S A095268 1,2,7,20,71,240,871,3148,11655,43332,162769,614198,2330537,8875768,
%T A095268 33924859,130038230,499753855,1924912894,7429160296,28723877732,111236423288,
%U A095268 431403470222
%N A095268 Number of distinct degree sequences among all n-vertex graphs with no 
               isolated vertices.
%C A095268 A002494 is the number of graphs on n nodes with no isolated points and 
               A095268 is the number of these graphs having distinct degree sequences.
%C A095268 Comment from Gordon Royle, Aug 29 2006: Is it true that a(n+1)/a(n) tends 
               to 4? Is there are a heuristic argument why this might be true?
%C A095268 Comment from Paul Hanna, Aug 18, 2006: Now that more terms have been 
               computed, we can see that this is not the self-convolution of any 
               integer sequence.
%H A095268 Frank Ruskey, <a href="http://www.cs.uvic.ca/~ruskey/Publications/AlleyCat.html">
               Title?</a>
%H A095268 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               DegreeSequence.html">Degree sequence</a>
%e A095268 a(4) = 7 because a 4-vertex graph with no isolated vertices can have 
               degree sequence 1111, 2211, 2222, 3111, 3221, 3322 or 3333.
%Y A095268 Cf. A000569, A002494, A004250; A007721 (analogue for connected graphs).
%Y A095268 Sequence in context: A000150 A115117 A029890 this_sequence A118397 A009697 
               A139012
%Y A095268 Adjacent sequences: A095265 A095266 A095267 this_sequence A095269 A095270 
               A095271
%K A095268 nonn,more
%O A095268 2,2
%A A095268 Eric Weisstein (eric(AT)weisstein.com), May 31, 2004
%E A095268 Edited by N. J. A. Sloane (njas(AT)research.att.com), Aug 26 2006
%E A095268 More terms from Gordon Royle (gordon(AT)maths.uwa.edu.au), Aug 21 2006
%E A095268 a(21) and a(22) from Frank Ruskey, Aug 29 2006
%E A095268 a(23) from Frank Ruskey, Aug 31 2006