For k >= 1, let p(k)=least h in N not already an a(i), q(k)=p(k)+k, a(3k-1)=q(k), a(3k)=p(k), a(3k+1)=least h in N not already an a(i).

A054086

For k >= 1, let p(k)=least h in N not already an a(i), q(k)=p(k)+k, a(3k-1)=q(k), a(3k)=p(k), a(3k+1)=least h in N not already an a(i).

Terms

    a(0) =1a(1) =3a(2) =2a(3) =4a(4) =7a(5) =5a(6) =6a(7) =11a(8) =8a(9) =9a(10) =14a(11) =10a(12) =12a(13) =18a(14) =13a(15) =15a(16) =22a(17) =16a(18) =17a(19) =26a(20) =19a(21) =20a(22) =29a(23) =21a(24) =23a(25) =33a(26) =24a(27) =25a(28) =37a(29) =27

External references