Search: id:A001432
Results 1-1 of 1 results found.

%I A001432 M1397 N0544
%S A001432 1,1,2,5,11,25,66,172,485,1446,4541,15036,52496,192218,737248,2952621,
%T A001432 12313532,53336122,239380403,1110793092,5318743428,26233496486,
%U A001432 133074975399
%N A001432 Number of graphs with n nodes and n-4 edges.
%D A001432 J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, p. 
               146.
%D A001432 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 
               (includes this sequence).
%D A001432 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%D A001432 M. L. Stein and P. R. Stein, Enumeration of Linear Graphs and Connected 
               Linear Graphs up to $p = 18$ Points. Report LA-3775, Los Alamos Scientific 
               Laboratory of the University of California, Los Alamos, NM, Oct 1967.
%Y A001432 Cf. A008406.
%Y A001432 Sequence in context: A097779 A106336 A047775 this_sequence A127075 A053429 
               A104237
%Y A001432 Adjacent sequences: A001429 A001430 A001431 this_sequence A001433 A001434 
               A001435
%K A001432 nonn,easy
%O A001432 0,3
%A A001432 N. J. A. Sloane (njas(AT)research.att.com).
%E A001432 More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Jan 03 2000

Search completed in 0.001 seconds