seq needs computing

[Michael Somos]

Neil asked about :

> 1 2 4 ? 9 ? ? 18 ...

which is by Finch. Perhaps it is the same one as this :

%I A014011
%S A014011 1,2,4,6,9,12,15,18,21,24,28,32,36,40,45,50,55,60,65,70,75,80,85,90,9
6, 
%T A014011 102,108,114,120,126,133,140,147,154,161,168,176,184,192,200,208,216,
%U A014011 225,234,243,252,261,270,280,290,300,310,320,330,341,352,363,374,385
%N A014011 Defined by a chi-inequality greedy algorithm.
%D A014011 E. Levine and J. O'Sullivan, An upper estimate for the reciprocal su
m of a sum-free sequence, Acta Arithmetica, 34 (1977), 9-24.
%D A014011 S. Finch, A convex maximization problem: Discrete case, math.OC/9912
035   
%H A014011 More info
%H A014011 More info
%H A014011 More info
%Y A014011 Cf. A051741, A051742.
%K A014011 nonn,nice
%O A014011 1,2
%A A014011 sp
%E A014011 More terms from Steven Finch (sfinch at mathsoft.com), Dec 07 1999

Shalom, Michael

-- 
Michael Somos <somos at grail.cba.csuohio.edu>     Cleveland State University
http://grail.cba.csuohio.edu/~somos/            Cleveland, Ohio, USA 44115