For k >= 1, let p(k) = least h in N not already an a(i), q(k) = p(k)+k, a(2k) = q(k), a(2k+1) = p(k).
A054089
For k >= 1, let p(k) = least h in N not already an a(i), q(k) = p(k)+k, a(2k) = q(k), a(2k+1) = p(k).
Terms
- a(0) =1a(1) =3a(2) =2a(3) =6a(4) =4a(5) =8a(6) =5a(7) =11a(8) =7a(9) =14a(10) =9a(11) =16a(12) =10a(13) =19a(14) =12a(15) =21a(16) =13a(17) =24a(18) =15a(19) =27a(20) =17a(21) =29a(22) =18a(23) =32a(24) =20a(25) =35a(26) =22a(27) =37a(28) =23a(29) =40
External references
- oeis: A054089