OEIS A000372

URI: https://gptkb.org/entity/OEIS_A000372
GPTKB entity
Statements (35)
Predicate Object
gptkbp:instanceOf integer sequence
gptkbp:author gptkb:N._J._A._Sloane
gptkbp:citation gptkb:Harary,_F.,_On_the_number_of_bi-colored_graphs_and_digraphs,_Pacific_J._Math.,_1962.
gptkb:OEIS_A001187
gptkb:OEIS_A001349
gptkb:OEIS_A005195
gptkb:OEIS_A006125
Harary, F. and Palmer, E. M., Graphical Enumeration, Academic Press, 1973.
gptkbp:describes Counts the number of connected labeled graphs with n nodes.
gptkbp:eighth_term 251548592
gptkbp:field graph theory
gptkbp:fifthBook 728
gptkbp:first_terms 1
gptkbp:fourthPlace 38
gptkbp:hasKeyword gptkb:center
easy
nice
core
hard
nonn
https://www.w3.org/2000/01/rdf-schema#label OEIS A000372
gptkbp:ninth_term 66296291072
gptkbp:OEIS gptkb:A000372
https://oeis.org/A000372
gptkbp:offset 1
gptkbp:sequence Number of connected labeled graphs with n nodes
gptkbp:sequence_formula a(n) = Sum_{k=1..binomial(n,2)} binomial(binomial(n,2),k) * c(n,k), where c(n,k) is the number of connected graphs with n nodes and k edges.
a(n) = Sum_{k=1..2^(n*(n-1)/2)} [graph with n nodes and k edges is connected]
gptkbp:seventhBook 1866256
gptkbp:sixthBook 26704
gptkbp:status approved
gptkbp:tenth_term 34496488594896
gptkbp:thirdPlace 4
gptkbp:bfsParent gptkb:Dedekind_number
gptkbp:bfsLayer 5