Skip to content

WeirdNumbers ​

The weird numbers 70,836,4030,…70, 836, 4030, … -- abundant but not semiperfect -- as a lazy indexed collection.

WeirdNumbersthe abundant nn with no proper-divisor subset summing to nn, an infinite indexed collection.

Domain: Collections

Details
  • A lazy indexed collection: Count(WeirdNumbers)=+∞Count(WeirdNumbers) = +\infty (infinitely many are known to exist), and AtAt unranks the kk-th by scanning forward, testing σ(n)−n>n\sigma(n) - n > n and then a subset-sum search over nn's proper divisors.
  • OEIS A006037. 7070 is the smallest: its proper divisors 1,2,5,7,10,14,351, 2, 5, 7, 10, 14, 35 sum past 7070 but no subset of them sums to exactly 7070.
  • Membership goes through Element: Element(70,WeirdNumbers)Element(70, WeirdNumbers) is true, Element(12,WeirdNumbers)Element(12, WeirdNumbers) is false (abundant, but semiperfect).

Enumeration

Examples

1 more kept as data, checked against the oracles
About
Examples1
CrosswalkOEISmathlib4

See also: Count, At, Element, AbundantNumbers, SemiperfectNumbers