|
Search: id:A006998
|
|
|
| A006998 |
|
Partitioning integers to avoid arithmetic progressions of length 3.
(Formerly M0990)
|
|
+0
1
|
|
| 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; listen)
|
|
|
OFFSET
|
0,3
|
|
|
REFERENCES
|
Gerver, Joseph; Propp, James; Simpson, Jamie; Greedily partitioning the natural numbers into sets free of arithmetic progressions. Proc. Amer. Math. Soc. 102 (1988), no. 3, 765-772.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
FORMULA
|
a(n) = a([ 2n/3 ]) + a([ (2n+1)/3 ]).
|
|
CROSSREFS
|
Sequence in context: A091065 A163823 A043723 this_sequence A043726 A043730 A043735
Adjacent sequences: A006995 A006996 A006997 this_sequence A006999 A007000 A007001
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Jim Propp (propp(AT)math.wisc.edu)
|
|
|
Search completed in 0.002 seconds
|
