Rohrbach's problem: a(n) is the largest integer such that there exists a set of n integers that is a basis of order 2 for (0, 1, ..., a(n)-1). 1, 3, 5, 9, 13, 17, 21, 27, 33, 41, 47, 5
2 seqfan posts