login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A085239 Sort the numbers 2^i and 3^j. Then a(n) is the base of the n-th term. Set a(1)=1. 6
1, 2, 3, 2, 2, 3, 2, 3, 2, 2, 3, 2, 3, 2, 2, 3, 2, 2, 3, 2, 3, 2, 2, 3, 2, 3, 2, 2, 3, 2, 2, 3, 2, 3, 2, 2, 3, 2, 3, 2, 2, 3, 2, 3, 2, 2, 3, 2, 2, 3, 2, 3, 2, 2, 3, 2, 3, 2, 2, 3, 2, 2, 3, 2, 3, 2, 2, 3, 2, 3, 2, 2, 3, 2, 3, 2, 2, 3, 2, 2, 3, 2, 3, 2, 2, 3, 2, 3, 2, 2, 3, 2, 2, 3, 2, 3, 2, 2, 3, 2, 3, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
The density of 2's in this sequence is log(3)/log(6). The density of 3's in this sequence is log(2)/log(6). - Jennifer Buckley, Apr 24 2024
LINKS
FORMULA
A006899(n) = a(n)^A085238(n).
For n > 1: a(n) = 2 + A006899(n) mod 2. - Reinhard Zumkeller, Oct 09 2013
MATHEMATICA
m = 40;
Join[{1}, If[Total[IntegerDigits[#, 2]] == 1, 2, 3]& /@ Union[3^Range[m], 2^Range[Length[IntegerDigits[3^m, 2]] - 1]]] (* Jean-François Alcover, Oct 07 2021 *)
PROG
(Haskell)
a085239 1 = 1
a085239 n = a006899 n `mod` 2 + 2 -- Reinhard Zumkeller, Oct 09 2013
CROSSREFS
Sequence in context: A116909 A333853 A182006 * A242872 A329362 A241604
KEYWORD
nonn,changed
AUTHOR
Reinhard Zumkeller, Jun 22 2003
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 27 23:22 EDT 2024. Contains 372020 sequences. (Running on oeis4.)