The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A257877 Sequence (a(n)) generated by Rule 1 (in Comments) with a(1) = 0 and d(1) = 3. 4
0, 1, 3, 2, 6, 4, 9, 5, 11, 8, 15, 10, 18, 12, 21, 14, 24, 16, 7, 19, 30, 20, 33, 22, 36, 23, 38, 26, 42, 28, 13, 31, 48, 32, 51, 34, 54, 35, 17, 39, 60, 40, 63, 41, 65, 44, 69, 46, 72, 47, 74, 50, 78, 52, 25, 55, 27, 56, 87, 58, 90, 59, 29, 62, 96, 64, 99 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
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
FORMULA
a(k+1) - a(k) = d(k+1) for k >= 1.
EXAMPLE
a(1) = 0, d(1) = 3;
a(2) = 1, d(2) = 1;
a(3) = 3, d(3) = 2;
a(4) = 2, d(4) = -1.
MATHEMATICA
a[1] = 0; d[1] = 3; 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}] (* A257877 *)
Table[d[k], {k, 1, zz}] (* A257915 *)
CROSSREFS
Sequence in context: A365312 A365080 A257903 * A257910 A006368 A202845
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, May 12 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 7 01:45 EDT 2024. Contains 373140 sequences. (Running on oeis4.)