This site is supported by donations to The OEIS Foundation.

 Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A265111 A rearrangement of the terms of A027746 (seen as flat list) such that adjacent terms are distinct. 3
 1, 2, 3, 2, 5, 2, 3, 2, 7, 2, 3, 2, 5, 3, 2, 11, 2, 3, 2, 13, 2, 7, 2, 5, 3, 2, 17, 2, 3, 2, 19, 3, 2, 5, 2, 7, 3, 2, 11, 2, 23, 2, 3, 2, 5, 2, 13, 5, 2, 3, 2, 7, 3, 2, 29, 3, 2, 5, 3, 2, 31, 2, 11, 3, 2, 17, 2, 7, 5, 2, 3, 2, 37, 3, 2, 19, 2, 13, 3, 2, 5, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Reinhard Zumkeller, Table of n, a(n) for n = 1..10000 EXAMPLE .  k  | 1 2 3 4   5 6   7 8     9   10   11 12     13 14  15  16       17 .     | 1 2 3 2*2 5 2*3 7 2*2*2 3*3 2*5  11 2*2*3  13 2*7 3*5 2*2*2*2  17 . ----+------------------------------------------------------------------- . a(n)| 1 2 3 2 5 2 3 2 7 2 3 2 5 3 2 11 2  3 2 13 2  7 2 5 3 2 17 2 3 2 .. PROG (Haskell) a265111 n = a265111_list !! (n-1) a265111_list = 1 : f 1 [] 0 1 where    f u [] w x = f 1 (reverse \$ a027746_row' (u * x)) w (x + 1)    f u (v:vs) w x | v == w    = f (u * v) vs w x                   | otherwise = v : f u vs v x CROSSREFS Cf. A027746, A265125 (partial products). Sequence in context: A076606 A056927 A094290 * A101876 A260218 A087986 Adjacent sequences:  A265108 A265109 A265110 * A265112 A265113 A265114 KEYWORD nonn AUTHOR Reinhard Zumkeller, Dec 01 2015 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 December 13 08:43 EST 2018. Contains 318082 sequences. (Running on oeis4.)