login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A294371 Lexicographically earliest sequence of distinct positive numbers such that, for any n > 0, a(3*n) = 2*a(n). 1
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 (list; graph; refs; listen; history; text; internal format)
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: A108918 A316472 A082334 * A325985 A151749 A175911

Adjacent sequences:  A294368 A294369 A294370 * A294372 A294373 A294374

KEYWORD

nonn,easy

AUTHOR

Rémy Sigrist, Oct 29 2017

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 21 17:14 EDT 2019. Contains 328302 sequences. (Running on oeis4.)