login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A178850 Lexicographically earliest infinite sequence such that (a(i)-a(j)) mod (a(k)-a(j)) is nonzero whenever i,j,k are disjoint. 0

%I #4 Apr 04 2015 21:46:57

%S 1,3,6,10,20,32,112,184,232,268,364,508,2308,3028,5332,8212,46372,

%T 75892,106852,116212,191812,222052,265252,298372,315652,328612,361012,

%U 401332,444532,507172,635332,706612,787252,943492,1147252,1210612,1270372

%N Lexicographically earliest infinite sequence such that (a(i)-a(j)) mod (a(k)-a(j)) is nonzero whenever i,j,k are disjoint.

%C First infinite picket-fence sequence: a picket fence extended from any pair in the set encounters no other member of the set.

%C Terms in this sequence gradually become restricted in increasing moduli. From a(7) on, all terms are == 4 (mod 12).

%e From the initial 1,3, no further terms can be odd. After 3,6, no further multiples of 3 are possible. After 1,3,6, an 8 would be legal, except that no further extension of the sequence is then possible.

%Y Cf. A178758.

%K nonn

%O 1,2

%A _Franklin T. Adams-Watters_, Jun 18 2010

%E More terms from _Jon E. Schoenfield_, Jun 25 2010

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 08:13 EDT 2024. Contains 371265 sequences. (Running on oeis4.)