login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A121385 Minimal number of three-term arithmetic progressions that a coloring of {1,...,n} can contain. 1

%I

%S 0,0,0,0,0,0,0,0,1,1,2,2,3,4,5,6,7,8,10,12,14,16,18,20,22,24,26,28,31,

%T 34,37,40,43,46

%N Minimal number of three-term arithmetic progressions that a coloring of {1,...,n} can contain.

%C a(9)=1 is the well known fact that the van der Waerden number for 2 colors and three-term arithmetic progressions is 9.

%e a(8)=0 because we can two color {1,...,8} by 11001100 so that there are no three-term arithmetic progressions.

%Y Cf. A121386.

%K nonn

%O 1,11

%A _Steve Butler_, Jul 26 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified May 24 02:16 EDT 2013. Contains 225613 sequences.