|
Search: id:A034463
|
|
|
| A034463 |
|
Maximal number of residue classes mod n such that no subset adds to 0. |
|
+0
1
|
|
| 0, 1, 1, 2, 2, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
REFERENCES
|
R. K. Guy, Unsolved Problems in Number Theory, Sect. C15.
|
|
EXAMPLE
|
For n=20, {1,-2,3,4,5,6} shows a(20)>= 6 (in fact a(20)=6). For n=30, {1,2,3,4,5,6,7} shows that a(30)>=7 (in fact a(30)=7).
|
|
CROSSREFS
|
Sequence in context: A036042 A162988 A143824 this_sequence A071996 A072747 A124755
Adjacent sequences: A034460 A034461 A034462 this_sequence A034464 A034465 A034466
|
|
KEYWORD
|
nonn,nice,more
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
The reference gives a(5)=3, but this is incorrect, a(5)=2.
More terms from John W. Layman (layman(AT)math.vt.edu), Oct 02 2002
|
|
|
Search completed in 0.005 seconds
|
