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!)
 A251767 Consecutive repeated terms removed from in A251539. 3
 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 1, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 1, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 1, 4, 3, 4, 3, 4, 2, 4, 3, 4, 3, 4, 3, 4, 1, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 1, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 2, 4, 1, 4, 3 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Reinhard Zumkeller, Table of n, a(n) for n = 1..10000 MATHEMATICA max = 2000 (* = max term of A251538 *); A098548 = {1, 2, 3}; For[n = 4, n <= 8 max, n++, If[GCD[n, A098548[[-1]]] == 1 && GCD[n, A098548[[-2]]] > 1, AppendTo[A098548, n]]]; A251538 = Select[Range[max], A098548[[2 # + 3]] > A098548[[2 # + 1]] + 6&]; A251539 = Differences[A251538]; First /@ Split[A251539] (* Jean-François Alcover, Aug 01 2018 *) PROG (Haskell) import Data.List (group) a251767 n = a251767_list !! (n-1) a251767_list = map head \$ group a251539_list CROSSREFS Cf. A251539, A251768. Sequence in context: A231475 A106055 A171783 * A168309 A103947 A178038 Adjacent sequences:  A251764 A251765 A251766 * A251768 A251769 A251770 KEYWORD nonn AUTHOR Reinhard Zumkeller, Dec 08 2014 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 April 6 18:51 EDT 2020. Contains 333286 sequences. (Running on oeis4.)