The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A006998 Partitioning integers to avoid arithmetic progressions of length 3. (Formerly M0990) 0
 0, 1, 2, 4, 6, 8, 12, 14, 16, 24, 26, 28, 32, 40, 48, 52, 54, 56, 64, 72, 80, 96, 100, 104, 108, 110, 112, 128, 136, 144, 160, 176, 192, 200, 204, 208, 216, 218, 220, 224, 240, 256, 272 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 REFERENCES N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). LINKS Joseph Gerver, James Propp and Jamie Simpson, Greedily partitioning the natural numbers into sets free of arithmetic progressions Proc. Amer. Math. Soc., Vol. 102, No. 3 (1988), 765-772. James Propp and N. J. A. Sloane, Email, March 1994 FORMULA a(n) = a([ 2n/3 ]) + a([ (2n+1)/3 ]). CROSSREFS Sequence in context: A331994 A043723 A331681 * A043726 A043730 A043735 Adjacent sequences:  A006995 A006996 A006997 * A006999 A007000 A007001 KEYWORD nonn,more AUTHOR STATUS approved

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

Last modified April 17 05:36 EDT 2021. Contains 343059 sequences. (Running on oeis4.)