OFFSET
1,2
COMMENTS
a(1)=1, a(2)=10; a(n) is least k such that no three terms of a(1), a(2), ..., a(n-1), k form an arithmetic progression.
FORMULA
a(n) = (Sum_{k=1..n-1} (3^A007814(k) + 1)/2) + f(n), with f(n) an 8-periodic function with values {1, 9, 8, 9, 5, 10, 10, 10, ...}, n >= 1, as proved by Lawrence Sze.
CROSSREFS
KEYWORD
nonn
AUTHOR
Ralf Stephan, Apr 09 2004
STATUS
approved