The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”). Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A257881 Sequence (a(n)) generated by Rule 1 (in Comments) with a(1) = 2 and d(1) = 1. 2
 2, 1, 3, 6, 4, 8, 5, 10, 16, 12, 7, 14, 22, 15, 9, 18, 28, 20, 11, 23, 13, 24, 37, 26, 40, 27, 42, 30, 46, 32, 17, 34, 52, 36, 19, 38, 58, 39, 21, 43, 64, 44, 67, 45, 69, 48, 25, 50, 76, 51, 78, 54, 82, 56, 29, 59, 31, 60, 91, 62, 94, 63, 33, 66, 100, 68, 35 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Rule 1 follows.  For k >= 1, let  A(k) = {a(1), …, a(k)} and D(k) = {d(1), …, d(k)}.  Begin with k = 1 and nonnegative integers a(1) and d(1). Step 1:   If there is an integer h such that 1 - a(k) < h < 0 and h is not in D(k) and a(k) + h is not in A(k), let d(k+1) be the greatest such h, let a(k+1) = a(k) + h, replace k by k + 1, and repeat Step 1; otherwise do Step 2. Step 2:  Let h be the least positive integer not in D(k) such that a(k) + h is not in A(k).  Let a(k+1) = a(k) + h and d(k+1) = h.  Replace k by k+1 and do Step 1. Conjecture:  if a(1) is an nonnegative integer and d(1) is an integer, then (a(n)) is a permutation of the nonnegative integers (if a(1) = 0) or a permutation of the positive integers (if a(1) > 0).  Moreover, (d(n)) is a permutation of the integers if d(1) = 0, or of the nonzero integers if d(1) > 0. See A257705 for a guide to related sequences. LINKS Clark Kimberling, Table of n, a(n) for n = 1..1000 FORMULA a(k+1) - a(k) = d(k+1) for k >= 1. EXAMPLE a(1) = 2, d(1) = 0; a(2) = 1, d(2) = -1; a(3) = 3, d(3) = 2; a(4) = 6, d(4) = 3. MATHEMATICA a = 2; d = 1; k = 1; z = 10000; zz = 120; A[k_] := Table[a[i], {i, 1, k}]; diff[k_] := Table[d[i], {i, 1, k}]; c[k_] := Complement[Range[-z, z], diff[k]]; T[k_] := -a[k] + Complement[Range[z], A[k]]; s[k_] := Intersection[Range[-a[k], -1], c[k], T[k]]; Table[If[Length[s[k]] == 0, {h = Min[Intersection[c[k], T[k]]], a[k + 1] = a[k] + h, d[k + 1] = h, k = k + 1}, {h = Max[s[k]], a[k + 1] = a[k] + h, d[k + 1] = h, k = k + 1}], {i, 1, zz}]; u = Table[a[k], {k, 1, zz}]  (* A257881 *) Table[d[k], {k, 1, zz}]  (* essentially A257880 *) CROSSREFS Cf. A257880, A257705, A081145, A257883, A175498. Sequence in context: A245182 A209160 A340406 * A268182 A094339 A317788 Adjacent sequences:  A257878 A257879 A257880 * A257882 A257883 A257884 KEYWORD nonn,easy AUTHOR Clark Kimberling, May 13 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 1 11:07 EST 2021. Contains 349429 sequences. (Running on oeis4.)