login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A257986
Sequence (a(n)) generated by Rule 3 (in Comments) with a(1) = 2 and d(1) = 1.
3
2, 4, 3, 6, 11, 5, 9, 7, 13, 8, 15, 12, 23, 10, 19, 37, 14, 27, 16, 31, 17, 33, 18, 35, 25, 21, 41, 20, 39, 22, 43, 24, 47, 29, 57, 26, 51, 42, 30, 59, 32, 63, 28, 55, 48, 40, 79, 34, 67, 38, 75, 36, 71, 45, 89, 46, 91, 44, 87, 49, 97, 53, 105, 50, 99, 58
OFFSET
1,1
COMMENTS
Rule 3 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 least 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.
See A257905 for a guide to related sequences and conjectures.
LINKS
FORMULA
a(n) - a(n-1) = A257982(n) for n >= 2.
EXAMPLE
a(1) = 2, d(1) = 1;
a(2) = 4, d(2) = 2;
a(3) = 3, d(3) = -1;
a(4) = 6, d(4) = 3.
MATHEMATICA
{a, f} = {{2}, {1}}; Do[tmp = {#, # - Last[a]} &[Min[Complement[#, Intersection[a, #]]&[Last[a] + Complement[#, Intersection[f, #]] &[Range[2 - Last[a], -1]]]]];
If[! IntegerQ[tmp[[1]]], tmp = {Last[a] + #, #} &[NestWhile[# + 1 &, 1, ! (! MemberQ[f, #] && ! MemberQ[a, Last[a] - #]) &]]]; AppendTo[a, tmp[[1]]]; AppendTo[f, tmp[[2]]], {120}]; {a, f} (* Peter J. C. Moses, May 14 2015 *)
CROSSREFS
Sequence in context: A002326 A285493 A064273 * A327743 A378846 A232564
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Jun 02 2015
STATUS
approved