OEIS A002850
E623992
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.
All labels observed (1)
| Label | Occurrences |
|---|---|
| OEIS A002850 canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T6833583 — 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 A002850 Context triple: [OEIS A064988, isRelatedTo, OEIS A002850]
-
A.
OEIS A002849
OEIS A002849 is the integer sequence that counts the number of partitions of n into distinct odd parts.
-
B.
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.
-
C.
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.
-
D.
Bell numbers
Bell numbers are a sequence in combinatorics that count the number of ways to partition a finite set into nonempty, unlabeled subsets.
-
E.
Catalan numbers
Catalan numbers are a sequence of natural numbers that count a wide variety of combinatorial structures, such as correctly matched parentheses, binary tree shapes, and lattice path configurations.
- 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 A002850 Target entity description: 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.
-
A.
OEIS A002849
OEIS A002849 is the integer sequence that counts the number of partitions of n into distinct odd parts.
-
B.
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.
-
C.
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.
-
D.
Bell numbers
Bell numbers are a sequence in combinatorics that count the number of ways to partition a finite set into nonempty, unlabeled subsets.
-
E.
Catalan numbers
Catalan numbers are a sequence of natural numbers that count a wide variety of combinatorial structures, such as correctly matched parentheses, binary tree shapes, and lattice path configurations.
- F. None of above. chosen
Statements (38)
| Predicate | Object |
|---|---|
| instanceOf |
OEIS entry
ⓘ
integer sequence ⓘ |
| hasApplications |
combinatorics
ⓘ
number theory ⓘ |
| hasAuthor |
N. J. A. Sloane
ⓘ
linked to:
Neil J. A. Sloane
|
| hasCrossReferences | other OEIS sequences ⓘ |
| hasEntryType | sequence of nonnegative integers ⓘ |
| hasFirstTerms |
1
ⓘ
10 ⓘ 11 ⓘ 12 ⓘ 13 ⓘ 14 ⓘ 15 ⓘ 16 ⓘ 17 ⓘ 18 ⓘ 19 ⓘ 2 ⓘ 20 ⓘ 8 ⓘ 9 ⓘ |
| hasFirstTerms |
3
ⓘ
4 ⓘ 5 ⓘ 6 ⓘ 7 ⓘ |
| hasKeyword |
easy
ⓘ
nice ⓘ nonn ⓘ |
| hasMathematicalDomain |
combinatorics
ⓘ
number theory ⓘ |
| hasOEISId | A002850 ⓘ |
| hasProperty |
infinite sequence
ⓘ
strictly increasing ⓘ |
| hasStatus | approved ⓘ |
| isInDatabase |
On-Line Encyclopedia of Integer Sequences
ⓘ
linked to:
Online Encyclopedia of Integer Sequences
|
| isWellStudied | true ⓘ |
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 A002850 Description of subject: 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.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.