A294371 - OEIS

%I #6 Oct 29 2017 13:05:30

%S 1,3,2,5,7,6,9,11,4,13,15,10,17,19,14,21,23,12,25,27,18,29,31,22,33,

%T 35,8,37,39,26,41,43,30,45,47,20,49,51,34,53,55,38,57,59,28,61,63,42,

%U 65,67,46,69,71,24,73,75,50,77,79,54,81,83,36,85,87,58,89

%N Lexicographically earliest sequence of distinct positive numbers such that, for any n > 0, a(3*n) = 2*a(n).

%C See A294370 for the inverse of this sequence, and additional comments.

%H <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>

%F a(A001651(i)*3^j) = A005408(i)*2^j for any i > 0 and j >= 0.

%e a(1) = 1 is suitable, and a(3^i) = 2^i for any i >= 0.

%e a(2) cannot equal 2 = a(3).

%e a(2) = 3 is suitable, and a(2*3^i) = 3*2^i for any i >= 0.

%e a(3) = 2*a(1) = 2.

%Y Cf. A001651, A005408, A294370 (inverse).

%K nonn,easy

%O 1,2

%A _Rémy Sigrist_, Oct 29 2017