login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A208746 Size of largest subset of [1..n] containing no three terms in geometric progression. 8

%I #37 May 19 2023 01:37:01

%S 1,2,3,3,4,5,6,7,7,8,9,10,11,12,13,13,14,14,15,15,16,17,18,19,19,20,

%T 21,21,22,23,24,24,25,26,27,27,28,29,30,31,32,33,34,34,35,36,37,38,38,

%U 38,39,39,40,41,42,43,44,45,46,46,47,48,49,49,50,51,52,52,53,54,55,55,56,57,57,57,58,59,60,61,61,62,63,64,65,66,67,68,69,70,71,71,72,73,74,74,75,75,75,75

%N Size of largest subset of [1..n] containing no three terms in geometric progression.

%C All three-term geometric progressions must be avoided, even those such as 4,6,9 whose ratio is not an integer.

%C _David Applegate_'s computation used a floating-point IP solver for the packing subproblems, so although it's almost certainly correct there is no proof. First he enumerated geometric progressions using

%C for (i=1;i<=N;i++) {

%C for (j=2; j*j<=i; j++) {

%C if (i % (j*j) != 0) continue;

%C for (k=1; k<j; k++) {

%C print i*k*k/(j*j), i*k/j, i;

%C }

%C }

%C }

%C and then solved the integer program of maximizing the subset of {1..N} subject to not taking all 3 of any progression.

%H Fausto A. C. Cariboni, <a href="/A208746/b208746.txt">Table of n, a(n) for n = 1..125</a>

%H K. O'Bryant, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL18/OBryant/obr3.html">Sets of Natural Numbers with Proscribed Subsets</a>, J. Int. Seq. 18 (2015) # 15.7.7.

%H <a href="/index/No#non_averaging">Index entries for non-averaging sequences</a>

%p # Maple program for computing the n-th term from _Robert Israel_:

%p A:= proc(n)

%p local cons, x;

%p cons:=map(op,{seq(map(t -> x[t]+x[b]+x[b^2/t]<=2,

%p select(t -> (t<b) and (t>=b^2/n),

%p numtheory:-divisors(b^2))),b=2..n-1)});

%p Optimization:-Maximize(add(x[i],i=1..n),cons, assume=binary)[1]

%p end proc;

%t a[n_] := a[n] = If[n <= 2, n, Module[{cons, x}, cons = And @@ Flatten@ Rest@ Union@ Table[x[#] + x[b] + x[b^2/#] <= 2& /@ Select[Divisors[b^2], # < b && # >= b^2/n&], {b, 2, n-1}]; Maximize[{Sum[x[i], {i, 1, n}], cons && AllTrue[Array[x, n], 0 <= # <= 1&]}, Array[x, n], Integers]][[1]]];

%t Reap[For[n = 1, n <= 100, n++, Print[n, " ", a[n]]; Sow[a[n]]]][[2, 1]] (* _Jean-François Alcover_, May 18 2023, after _Robert Israel_ *)

%Y Cf. A003002.

%K nonn

%O 1,2

%A _David Applegate_ and _N. J. A. Sloane_, Mar 01 2012

%E a(1)-a(82) confirmed by _Robert Israel_ and extended to a(100), Mar 01 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 16:45 EDT 2024. Contains 371989 sequences. (Running on oeis4.)