A002182
E1094047
UNEXPLORED
A002182 is the OEIS sequence that lists the highly composite numbers, integers with more divisors than any smaller positive integer.
All labels observed (1)
| Label | Occurrences |
|---|---|
| A002182 canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T14334680 — 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: A002182 Context triple: [highly composite number, OEISSequence, A002182]
-
A.
OEIS A002851
OEIS A002851 is a sequence in the On-Line Encyclopedia of Integer Sequences that records the number of connected labeled graphs on n nodes.
-
B.
OEIS A002849
OEIS A002849 is the integer sequence that counts the number of partitions of n into distinct odd parts.
-
C.
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.
-
D.
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.
-
E.
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.
- 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: A002182 Target entity description: A002182 is the OEIS sequence that lists the highly composite numbers, integers with more divisors than any smaller positive integer.
-
A.
OEIS A002851
OEIS A002851 is a sequence in the On-Line Encyclopedia of Integer Sequences that records the number of connected labeled graphs on n nodes.
-
B.
OEIS A002849
OEIS A002849 is the integer sequence that counts the number of partitions of n into distinct odd parts.
-
C.
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.
-
D.
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.
-
E.
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.
- F. None of above. chosen
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.
subject surface form:
highly composite number