The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 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 A006899(n) = a(n)^A085238(n); LINKS T. D. Noe, Table of n, a(n) for n=1..500 FORMULA For n > 1: a(n) = 2 + A006899(n) mod 2. - Reinhard Zumkeller, Oct 09 2013 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 Adjacent sequences:  A085236 A085237 A085238 * A085240 A085241 A085242 KEYWORD nonn 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 28 19:56 EDT 2021. Contains 347717 sequences. (Running on oeis4.)