A099107 a(n) is the least M such that there are n values in 0..M with no two values summing to a square.

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

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

Rob Pratt, Table of n, a(n) for n = 1..100

Crossrefs

If the numbers are taken from 1..M instead of 0..M, we get A210380.

Sequence in context: A153000 A222172 A326379 * A261255 A085833 A066896

Adjacent sequences: A099104 A099105 A099106 * A099108 A099109 A099110

Keyword

nonn

Author

Jean-Charles Meyrignac (euler(AT)free.fr), Nov 14 2004

Extensions

Definition clarified and sequence extended by Don Reble and M. F. Hasler, Jul 08 2014

More terms from Rob Pratt, Jul 11 2014

Status

approved