|
|
A099107
|
|
a(n) is the least M such that there are n values in 0..M with no two values summing to a square.
|
|
2
|
|
|
0, 2, 3, 5, 8, 10, 11, 14, 18, 20, 21, 24, 26, 28, 32, 34, 36, 38, 40, 42, 48, 52, 54, 56, 58, 60, 62, 64, 72, 74, 76, 78, 80, 82, 84, 86, 88, 99, 101, 103, 105, 107, 109, 111, 114, 116, 118, 129, 130, 133, 135, 137, 139, 141, 143, 145, 152, 159, 160, 163, 167
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Examples where the solution is unique:
(14,28) 2 4 6 9 11 13 15 17 18 20 22 24 26 28
(16,34) 3 5 8 10 12 14 16 18 19 21 23 25 27 29 32 34
(17,36) 3 5 8 10 12 14 16 18 19 21 23 25 27 29 32 34 36
(18,38) 3 5 8 10 12 14 16 18 19 21 23 25 27 29 32 34 36 38
(19,40) 3 5 8 10 12 14 16 18 19 21 23 25 27 29 32 34 36 38 40
(20,42) 3 5 8 10 12 14 16 18 19 21 23 25 27 29 32 34 36 38 40 42
|
|
LINKS
|
|
|
CROSSREFS
|
If the numbers are taken from 1..M instead of 0..M, we get A210380.
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Jean-Charles Meyrignac (euler(AT)free.fr), Nov 14 2004
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|