[seqfan] Re: Noninterfering picket fence seeds

[Ron Hardin]

Update,
1 2 6 8 18 21 33 38 54 66 83

concrete solutions
a(1) 1
a(2) 1 2
a(3) 1 3 6
a(4) 1 3 6 8
a(5) 1 4 8 14 18
a(6) 1 4 8 14 18 21
a(7) 1 7 11 14 18 24 33
a(8) 1 5 11 15 24 28 34 38
a(9) 1 10 16 20 23 27 33 42 54
a(10) 1 13 22 28 32 35 39 45 54 66
a(11) 1 7 15 21 30 36 46 58 68 74 83

eg., a(10) contains 22 and 32, and so no instance of 2 12 42 52 62




 rhhardin at mindspring.com
rhhardin at att.net (either)



----- Original Message ----
> From: Ron Hardin <rhhardin at att.net>
> To: seqfan at seqfan.eu
> Sent: Tue, May 25, 2010 12:50:27 PM
> Subject: [seqfan]  Noninterfering picket fence seeds
> 
> Take n integers in x(i) in 1..L such that (x(j)-x(i)) mod (x(k)-x(i)) is nonzero 
> for every disjoint triple i,j,k

What is the smallest L that allows n such 
> integers to exist?






_______________________________________________

Seqfan 
> Mailing list - 
> >http://list.seqfan.eu/