This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A255671 Number of the column of the Wythoff array (A035513) that contains U(n), where U = A001950, the upper Wythoff sequence. 3
 2, 4, 2, 2, 6, 2, 4, 2, 2, 4, 2, 2, 8, 2, 4, 2, 2, 6, 2, 4, 2, 2, 4, 2, 2, 6, 2, 4, 2, 2, 4, 2, 2, 10, 2, 4, 2, 2, 6, 2, 4, 2, 2, 4, 2, 2, 8, 2, 4, 2, 2, 6, 2, 4, 2, 2, 4, 2, 2, 6, 2, 4, 2, 2, 4, 2, 2, 8, 2, 4, 2, 2, 6, 2, 4, 2, 2, 4, 2, 2, 6, 2, 4, 2, 2, 4 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS All the terms are even, and every even positive integer occurs infinitely many times. LINKS FORMULA a(n) = 2 if and only if n = L(j) for some j; otherwise, n = U(k) for some k. a(n) = A225670(n) + 1 = A035612(A001950 (n)). EXAMPLE Corner of the Wythoff array: 1   2   3   5   8   13 4   7   11  18  29  47 6   10  16  26  42  68 9   15  24  39  63  102 L = (1,3,4,6,8,9,11,...); U = (2,5,7,10,13,15,18,...), so that A255670 = (1,3,1,1,5,...) and A255671 = (2,4,2,2,6,...). MATHEMATICA z = 13; r = GoldenRatio; f[1] = {1}; f[2] = {1, 2}; f[n_] := f[n] = Join[f[n - 1], Most[f[n - 2]], {n}]; f[z]; g[n_] := g[n] = f[z][[n]]; Table[g[n], {n, 1, 100}]  (* A035612 *) Table[g[Floor[n*r]], {n, 1, (1/r) Length[f[z]]}]     (* A255670 *) Table[g[Floor[n*r^2]], {n, 1, (1/r^2) Length[f[z]]}] (* A255671 *) CROSSREFS Cf. A255670, A035612, A000201, A001950. Sequence in context: A294354 A144049 A058384 * A055097 A258751 A280233 Adjacent sequences:  A255668 A255669 A255670 * A255672 A255673 A255674 KEYWORD nonn,easy AUTHOR Clark Kimberling, Mar 03 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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 20 14:28 EDT 2018. Contains 316381 sequences. (Running on oeis4.)