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

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, 35, 8, 37, 39, 26, 41, 43, 30, 45, 47, 20, 49, 51, 34, 53, 55, 38, 57, 59, 28, 61, 63, 42, 65, 67, 46, 69, 71, 24, 73, 75, 50, 77, 79, 54, 81, 83, 36, 85, 87, 58, 89

Offset

1,2

Comments

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

Links

Table of n, a(n) for n=1..67.

Index entries for sequences that are permutations of the natural numbers

Formula

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

Example

a(1) = 1 is suitable, and a(3^i) = 2^i for any i >= 0.
a(2) cannot equal 2 = a(3).
a(2) = 3 is suitable, and a(2*3^i) = 3*2^i for any i >= 0.
a(3) = 2*a(1) = 2.

Crossrefs

Cf. A001651, A005408, A294370 (inverse).

Sequence in context: A341915 A371975 A082334 * A325985 A151749 A175911

Adjacent sequences: A294368 A294369 A294370 * A294372 A294373 A294374

Keyword

nonn,easy

Author

Rémy Sigrist, Oct 29 2017

Status

approved