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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A283438 The largest possible size of a set in F_3^n, free of three-term arithmetic progressions with the difference in {0,1}^n. 1
 1, 2, 6, 14, 36 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS 102 <= a(5) <= 108. - Robert Israel, Mar 10 2017 LINKS Robert Israel, Set of size 36 for n=4 Robert Israel, Set of size 102 for n=5 EXAMPLE a(0) = 1: {()}. a(1) = 2: {(0), (1)}. a(2) = 6: {(0,0), (0,2), (1,1), (1,2), (2,0), (2,1)}. a(3) = 14: {(0,0,0), (0,0,2), (0,2,0), (0,2,2), (1,0,1), (1,0,2), (1,1,0), (1,1,1), (1,2,0), (1,2,2), (2,0,0), (2,0,1), (2,1,0), (2,1,1)}. PROG (PARI) \\ This code is for demonstration only, it is far too slow for computation! ok(v)=vecmax(lift(v))<2 has(v)=my(t); for(i=1, #v, for(j=1, #v, if(i==j, next); for(k=1, #v, if(i==k||j==k, next); t=v[i]-v[j]; if(v[j]-v[k]==t && ok(t), return(0))))); 1 a(n)=my(N=3^n, v=vector(N, i, digits(N+i-1, 3)[2..n+1]), u, r, t); for(i=0, 2^N-1, u=Mod(vecextract(v, i), 3); if(has(u), t=hammingweight(i); if(t>r, r=t))); r \\ Charles R Greathouse IV, Mar 07 2017 CROSSREFS Sequence in context: A231509 A318018 A025257 * A323027 A110152 A245560 Adjacent sequences:  A283435 A283436 A283437 * A283439 A283440 A283441 KEYWORD nonn,more,hard AUTHOR Vsevolod F. Lev, Mar 07 2017 EXTENSIONS a(4) from Robert Israel, Mar 07 2017 STATUS approved

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.

Last modified August 8 21:07 EDT 2022. Contains 356016 sequences. (Running on oeis4.)