OEIS A002851
E624671
OEIS A002851 is a sequence in the On-Line Encyclopedia of Integer Sequences that records the number of connected labeled graphs on n nodes.
Statements (52)
| Predicate | Object |
|---|---|
| instanceOf |
OEIS sequence
ⓘ
integer sequence ⓘ |
| a(1) | 1 ⓘ |
| a(10) | 34496488594816 ⓘ |
| a(11) | 35641657548953344 ⓘ |
| a(12) | 73354596206766622208 ⓘ |
| a(13) | 301272202649664088951808 ⓘ |
| a(14) | 2471648811030443735290894336 ⓘ |
| a(15) | 40527680937730480234609755340800 ⓘ |
| a(16) | 1320657822628159441281355119324930048 ⓘ |
| a(17) | 86684206303811924264506937974806264397824 ⓘ |
| a(18) | 11329486984216510280478004555860467490438287360 ⓘ |
| a(19) | 2957754463548243163499529539569898489338039306240 ⓘ |
| a(2) | 1 ⓘ |
| a(20) | 1543267864443420616578444368765248254899281625116672 ⓘ |
| a(3) | 4 ⓘ |
| a(4) | 38 ⓘ |
| a(5) | 728 ⓘ |
| a(6) | 26704 ⓘ |
| a(7) | 1866256 ⓘ |
| a(8) | 251548592 ⓘ |
| a(9) | 66296291072 ⓘ |
| author | N. J. A. Sloane NERFINISHED ⓘ |
| comment | A000088 counts all labeled graphs on n nodes; A002851 counts only the connected ones ⓘ |
| connectedness | connected graphs only ⓘ |
| counts | connected labeled graphs ⓘ |
| crossReference |
A000088
ⓘ
A001187 ⓘ A003024 ⓘ A006125 ⓘ |
| describes | number of connected labeled graphs on n nodes ⓘ |
| domain | nonnegative integers n ≥ 1 ⓘ |
| exponentialGeneratingFunction | log(sum_{n>=0} 2^{n(n-1)/2} x^n/n!) ⓘ |
| firstTermIndex | n = 1 ⓘ |
| graphType | simple graphs ⓘ |
| hasOEISIndex | A002851 ⓘ |
| isFiniteForEachN | true ⓘ |
| isInDatabase | On-Line Encyclopedia of Integer Sequences NERFINISHED ⓘ |
| keyword |
fini
ⓘ
full ⓘ hard ⓘ more ⓘ nice ⓘ nonn ⓘ nonnegative ⓘ |
| labeling | labeled vertices ⓘ |
| offset | 1 ⓘ |
| parameter | number of nodes n ⓘ |
| relatedTo | OEIS A000088 NERFINISHED ⓘ |
| subjectArea |
combinatorics
ⓘ
graph theory ⓘ |
| title | Number of connected labeled graphs with n nodes ⓘ |
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.