combinatorics / Enumerative combinatorics

Kurkov's Fubini-Number Sum Conjecture

For the Fubini numbers $a(n)$, is $a(n) = \sum_{k=0}^{2^{n-1}-1} A284005(k)$ for every $n > 0$, as conjectured on the OEIS in 2018?

5Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

combinatoricsJul 8, 2026Significance 5/100Registry: unreviewed

Kurkov's Fubini-Number Sum Conjecture

Prior state unknownproved

For the Fubini numbers $a(n)$, is $a(n) = \sum_{k=0}^{2^{n-1}-1} A284005(k)$ for every $n > 0$, as conjectured on the OEIS in 2018?

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

For the Fubini numbers $a(n)$, is $a(n) = \sum_{k=0}^{2^{n-1}-1} A284005(k)$ for every $n > 0$, as conjectured on the OEIS in 2018?

Recorded attempts

Evidence graph

Connected research record

No public relationships recorded yet.