Consider the sequence of 4-tuples {0,a,b,c} (c>=a+b; a,b,c>0) which have the smallest integer 'c' required to reach {k,k,k,k} in n steps under map {r,s,t,u}->{|r-s|,|s-t|,|t-u|,|u-r|}. This sequence gives the second term 'a' of these quadruples.

A034803

Consider the sequence of 4-tuples {0,a,b,c} (c>=a+b; a,b,c>0) which have the smallest integer 'c' required to reach {k,k,k,k} in n steps under map {r,s,t,u}->{|r-s|,|s-t|,|t-u|,|u-r|}. This sequence gives the second term 'a' of these quadruples.

Terms

    a(0) =1a(1) =0a(2) =0a(3) =1a(4) =0a(5) =1a(6) =1a(7) =2a(8) =2a(9) =5a(10) =6a(11) =7a(12) =17a(13) =20a(14) =24a(15) =57a(16) =68a(17) =81a(18) =193a(19) =230a(20) =274a(21) =653a(22) =778a(23) =927a(24) =2209a(25) =2632a(26) =3136a(27) =7473a(28) =8904a(29) =10609

External references