Some OEIS computations
Results
-
A059756: Erdős-Woods numbers
table up to 100,000. Note the primes on the list: 15493, 18637, 43613, 45179, 61333, 67807, 68483, 80671, 87383.
code (C++, using MiniSat)
-
A111042: Odd Erdős-Woods numbers
table up to 100,000.
Sublist of A059756.
-
A174094: Number of ways to choose n positive integers less than or equal to 2n such that none of the n integers divides another.
table for n = 1..3400.
code (Haskell)
-
A219158: Minimum number of integer-sided squares needed to tile an m by n rectangle.
table up to 380×380. Computing power provided by Massimo Ortolano.
more information
History
2016-07-31 Initial version
2019-04-12 Added A174094
Bertram Felgenhauer | valid HTML