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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A350315 Length of the rows of the Redstone permutation A350313. 2
 2, 3, 6, 6, 6, 6, 8, 4, 6, 6, 6, 8, 4, 6, 6, 6, 8, 4, 6, 6, 6, 8, 4, 6, 6, 6, 8, 4, 6, 6, 6, 8, 4, 6, 6, 6, 12, 6, 6, 6, 8, 4, 6, 6, 6, 8, 4, 6, 6, 6, 8, 4, 6, 6, 6, 8, 4, 6, 6, 6, 8, 4, 6, 6, 6, 8, 4, 6, 6, 6, 12, 6, 6, 6, 8, 4, 6, 6, 6, 8, 4, 6, 6, 6, 8, 4 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS See the comments and the example section of A350313 for definitions. LINKS Table of n, a(n) for n=1..86. FORMULA Apparently for n >= 4: a(n) = 2 * b(n - 4) + 6, where the generating function of b(n) is (-3*x^33 + x^29 - x^28 + x^24 - x^23 + x^19 - x^18 + x^14 - x^13 + x^9 - x^8 + x^4 - x^3)/(x^34 - 1). MATHEMATICA s = {2, 1}; c[_] = 0; Array[Set[c[s[[#]]], #] &, Length[s]]; j = Last[s]; u = 3; Prepend[Differences[#], First[#]] &[{2}~Join~Reap[Monitor[Do[If[j == u, While[c[u] > 0, u++]]; k = u; While[Nand[c[k] == 0, CoprimeQ[i, k], ! Divisible[i - 1, k]], k++]; If[k == u, Sow[i]]; Set[c[k], i]; j = k, {i, Length[s] + 1, 500}], i]][[-1, -1]]] (* Michael De Vlieger, Dec 24 2021 *) CROSSREFS Cf. A350313, A350314. Sequence in context: A151850 A290223 A274213 * A078706 A077082 A333936 Adjacent sequences: A350312 A350313 A350314 * A350316 A350317 A350318 KEYWORD nonn AUTHOR Peter Luschny, Dec 24 2021 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.

Last modified March 1 11:52 EST 2024. Contains 370432 sequences. (Running on oeis4.)