OFFSET
1,2
COMMENTS
Trivial lower bound: a(n) >= A013928(n+1). - Charles R Greathouse IV, Oct 20 2013
McNew proves that if n is sufficiently large, then the n-th term is between 0.818n and 0.820n. - Kevin O'Bryant, Aug 17 2015
LINKS
Fausto A. C. Cariboni, Table of n, a(n) for n = 1..152
M. Beiglboeck, V. Bergelson, N. Hindman, and D. Strauss, Multiplicative structures in additively large sets, J. Combin. Theory Ser. A 113 (2006)
N. McNew, On sets of integers which contain no three terms in geometric progression, arXiv:1310.2277 [math.NT], 2013.
M. B. Nathanson and K. O'Bryant, A problem of Rankin on sets without geometric progressions, arXiv:1408.2880 [math.NT], 2014.
K. O'Bryant, Sets of natural numbers with proscribed subsets, arXiv:1410.4900 [math.NT], 2014-2015.
EXAMPLE
The integers [1..9] include the three geometric progressions (1,2,4) (2,4,8) and (1,3,9), which cannot all be precluded with any 1 exclusion, but 2 exclusions suffice. Thus the size of the largest subsets of [1..9] free of integer ratio geometric progressions is 7.
PROG
(PARI) ok(v)=for(i=3, #v, my(k=v[i]); fordiv(core(k, 1)[2], d, if(d>1 && setsearch(v, k/d) && setsearch(v, k/d^2), return(0)))); 1
a(n)=my(v=select(k->4*k>n&&issquarefree(k), vector(n, i, i)), u=setminus(vector(n, i, i), v), r, H); for(i=1, 2^#u-1, H=hammingweight(i); if(H>r && ok(vecsort(concat(v, vecextract(u, i)), , 8)), r=H)); #v+r \\ Charles R Greathouse IV, Oct 20 2013
CROSSREFS
KEYWORD
nonn
AUTHOR
Nathan McNew, Oct 20 2013
STATUS
approved
