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.
All labels observed (1)
| Label | Occurrences |
|---|---|
| OEIS A002851 canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T6833584 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: OEIS A002851 Context triple: [OEIS A064988, isRelatedTo, OEIS A002851]
-
A.
OEIS A002850
OEIS A002850 is a sequence in the On-Line Encyclopedia of Integer Sequences that catalogs a specific, well-studied pattern of integers with notable combinatorial or number-theoretic significance.
-
B.
OEIS A002849
OEIS A002849 is the integer sequence that counts the number of partitions of n into distinct odd parts.
-
C.
OEIS A064988
OEIS A064988 is the entry in the On-Line Encyclopedia of Integer Sequences that records the decimal expansion of Gauss’s constant, a notable mathematical constant arising in elliptic integrals and number theory.
-
D.
Sylvester sequence
The Sylvester sequence is an integer sequence defined recursively where each term is one more than the product of all previous terms, yielding rapidly growing, pairwise coprime numbers closely related to Egyptian fraction representations.
-
E.
Look-and-say sequence
The look-and-say sequence is a famous integer sequence where each term is generated by verbally describing the digits of the previous term, studied for its surprising combinatorial and growth properties.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: OEIS A002851 Target entity description: OEIS A002851 is a sequence in the On-Line Encyclopedia of Integer Sequences that records the number of connected labeled graphs on n nodes.
-
A.
OEIS A002850
OEIS A002850 is a sequence in the On-Line Encyclopedia of Integer Sequences that catalogs a specific, well-studied pattern of integers with notable combinatorial or number-theoretic significance.
-
B.
OEIS A002849
OEIS A002849 is the integer sequence that counts the number of partitions of n into distinct odd parts.
-
C.
OEIS A064988
OEIS A064988 is the entry in the On-Line Encyclopedia of Integer Sequences that records the decimal expansion of Gauss’s constant, a notable mathematical constant arising in elliptic integrals and number theory.
-
D.
Sylvester sequence
The Sylvester sequence is an integer sequence defined recursively where each term is one more than the product of all previous terms, yielding rapidly growing, pairwise coprime numbers closely related to Egyptian fraction representations.
-
E.
Look-and-say sequence
The look-and-say sequence is a famous integer sequence where each term is generated by verbally describing the digits of the previous term, studied for its surprising combinatorial and growth properties.
- F. None of above. chosen
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
ⓘ
linked to:
Neil J. A. Sloane
|
| 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
ⓘ
linked to:
Online Encyclopedia of Integer Sequences
|
| keyword |
fini
ⓘ
full ⓘ hard ⓘ more ⓘ nice ⓘ nonn ⓘ nonnegative ⓘ |
| labeling | labeled vertices ⓘ |
| offset | 1 ⓘ |
| parameter | number of nodes n ⓘ |
| relatedTo | OEIS A000088 ⓘ |
| subjectArea |
combinatorics
ⓘ
graph theory ⓘ |
| title | Number of connected labeled graphs with n nodes ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: OEIS A002851 Description of subject: OEIS A002851 is a sequence in the On-Line Encyclopedia of Integer Sequences that records the number of connected labeled graphs on n nodes.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.