A276661 · WATCH
A self-validating distributed computer extending OEIS sequence
A276661 — the Erdős distinct-subset-sum
problem ($500 standing prize since 1969).
frontier
term #11
bounded by 594 so far
last proved
a(9) = 161
{77, 117, 137, 148, 154, 157, …}
terms known
10
values of a(n) determined
throughput
0.0/min
▄ ▄ █ ▄ · 25 today
workers
27
across 4 machines
live · search branches in flight
12 active right now
oeis-grinder/w3searching a(11) — 63 min so far (+14 queued)long tail — could be a while
oeis-grinder/w1searching a(11) — 63 min so far (+14 queued)long tail — could be a while
oeis-grinder/w4searching a(11) — 63 min so far (+14 queued)long tail — could be a while
oeis-grinder/w6searching a(11) — 62 min so far (+19 queued)long tail — could be a while
oeis-grinder/w5searching a(11) — 62 min so far (+19 queued)long tail — could be a while
oeis-grinder/w2searching a(11) — 62 min so far (+9 queued)long tail — could be a while
hunter/w4searching a(11) — 62 min so far (+19 queued)long tail — could be a while
hunter/w0searching a(11) — 62 min so far (+14 queued)long tail — could be a while
oeis-grinder/w0searching a(11) — 61 min so far (+19 queued)long tail — could be a while
hunter/w7searching a(11) — 61 min so far (+14 queued)long tail — could be a while
hunter/w3searching a(11) — 61 min so far (+14 queued)long tail — could be a while
hunter/w2searching a(11) — 59 min so far (+19 queued)long tail — could be a while
the sequence
frontier first, then descending
PAUSED a( 11)?at most 594paused
PROVED a( 9)=161by this system {77, 117, 137, 148, 154, 157, 159, 160, 161}
PROVED a( 8)=84by this system {40, 60, 71, 77, 80, 82, 83, 84}
PROVED a( 7)=44by this system {20, 31, 37, 40, 42, 43, 44}
PROVED a( 6)=24by this system {11, 17, 20, 22, 23, 24}
PROVED a( 5)=13by this system {6, 9, 11, 12, 13}
PROVED a( 4)=7by this system {3, 5, 6, 7}
PROVED a( 3)=4by this system {2, 3, 4}
PROVED a( 10)=309from prior literature {148, 225, 265, 285, 296, 302, 305, 307, 308, 309}
PROVED a( 2)=2trivial {1, 2}
PROVED a( 1)=1trivial {1}
QUEUED a( 12)?at most 1164queued; the search will pick this up next
workers one row per machine, not per thread
diag[▮···········]1 workers
grinder-diag[▮···········]1 workers
hunter[▮▮▮▮▮▮▮▮▮▮▮▮]13 workers
oeis-grinder[▮▮▮▮▮▮▮▮▮▮▮▮]12 workers
Got spare CPU? A worker takes ~5 minutes to spin up and
contributes directly to the search. No data leaves your machine
except the integer results.
join the search →
