A257908 -id:A257908 - cp's OEIS frontend

A257883 Sequence (a(n)) generated by Algorithm (in Comments) with a(1) = 0 and d(1) = 0.

0, 1, 3, 2, 5, 9, 4, 10, 6, 11, 8, 15, 7, 16, 14, 22, 12, 23, 17, 27, 13, 25, 18, 31, 19, 33, 20, 35, 24, 40, 21, 38, 29, 47, 26, 45, 28, 48, 30, 51, 36, 58, 32, 55, 39, 63, 34, 59, 37, 64, 41, 67, 42, 70, 43, 72, 44, 74, 50, 81, 46, 78, 111, 49, 83, 52, 87

Offset: 1

Clark Kimberling, May 13 2015

Algorithm: 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). Let h be the least integer > -a(k) such that h is not in D(k) and 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 repeat inductively.
Conjecture: if a(1) is a 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.
Guide to related sequences:
a(1)   d(1)    (a(n))       (d(n))
0      0      A257883      A175499 except for initial terms
0      1      A257884      A175499
0      2      A257885      A257902
0      3      A257903      A257904
1      0      A175498      A175499 except for first term
1      1      A257905      A175499
2      0      A257908      A257909
2      1      A257910      A257909 except for initial terms
2      2      A257911      A257912

			a(1) = 0, d(1) = 0;
a(2) = 1, d(2) = 1;
a(3) = 3, d(3) = 2;
a(4) = 2, d(4) = -1.

Clark Kimberling, Table of n, a(n) for n = 1..1000

Cf. A081145, A175498, A257705.

a[1] = 0; d[1] = 0; 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]]
Table[{h = Min[Intersection[c[k], T[k]]], a[k + 1] = a[k] + h,
   d[k + 1] = h, k = k + 1}, {i, 1, zz}];
u = Table[a[k], {k, 1, zz}]  (* A257883, = -1 + A175498 *)
Table[d[k], {k, 1, zz}] (* A175499 except that here first term is 0 *)

a(k+1) - a(k) = d(k+1) for k >= 1.

Also, A257883(n) = -1 + A175498(n) for n >= 1.

A257905 Sequence (a(n)) generated by Rule 3 (in Comments) with a(1) = 0 and d(1) = 0.

Original entry on oeis.org

0, 1, 3, 2, 5, 11, 4, 9, 6, 13, 7, 15, 10, 8, 17, 35, 12, 25, 14, 29, 16, 33, 18, 37, 19, 39, 20, 41, 21, 43, 22, 45, 23, 47, 30, 26, 53, 24, 49, 40, 28, 57, 27, 55, 31, 63, 32, 65, 38, 42, 34, 69, 36, 73, 48, 97, 44, 89, 46, 93, 51, 103, 52, 105, 50, 101

Offset: 1

Clark Kimberling, May 16 2015

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.
Conjecture:  suppose that a(1) is an nonnegative integer and d(1) is an integer.
If a(1) = 0 and d(1) != 1, then (a(n)) is a permutation of the nonnegative integers;
if a(1) = 0 and d(1) = 1, then (a(n)) is a permutation of the nonnegative integers excluding 1;
if a(1) = 1, then (a(n)) is a permutation of the positive integers;
if a(1) > 1, then (a(n)) is a permutation of the integers >1;
if d(1) = 0, then (d(n)) is a permutation of the integers;
if d(1) !=0, then (d(n)) is a permutation of the nonzero integers.
Guide to related sequences:
a(1)  d(1)      (a(n))       (d(n))
0       0      A257905      A258047
0       1      A257906      A257907
0       2      A257908      A257909
0       3      A257910      A257980
1       0      A258046      A258047
1       1      A257981      A257982
1       2      A257983      A257909
2       0      A257985      A257047
2       1      A257986      A257982
2       2      A257987      A257909

			a(1) = 0, d(1) = 0;
a(2) = 1, d(2) = 1;
a(3) = 3, d(3) = 2;
a(4) = 2, d(4) = -1.

Clark Kimberling, Table of n, a(n) for n = 1..1000

Cf. A258047, A257705, A257883, A175498.

Cf. A256283 (putative inverse).

import Data.List ((\\))
a257905 n = a257905_list !! (n-1)
a257905_list = 0 : f [0] [0] where
   f xs@(x:_) ds = g [2 - x .. -1] where
     g [] = y : f (y:xs) (h:ds) where
                  y = x + h
                  (h:_) = [z | z <- [1..] \\ ds, x - z `notElem` xs]
     g (h:hs) | h `notElem` ds && y `notElem` xs = y : f (y:xs) (h:ds)
              | otherwise = g hs
              where y = x + h
-- Reinhard Zumkeller, Jun 03 2015

{a, f} = {{0}, {0}}; 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 *)

a(n) = A258046(n) - 1 for n >= 1.

A257909 Sequence (d(n)) generated by Rule 3 (in Comments) with a(1) = 0 and d(1) = 2.

Original entry on oeis.org

2, 1, 3, -2, 4, -3, 5, -1, 8, -10, 6, 12, -14, 10, -9, 11, -8, 14, -15, 13, -11, 15, -13, 17, -16, 18, -17, 19, -7, -6, -4, 21, -19, 23, -5, -12, 29, -31, 27, -22, 32, -29, 35, -37, 33, -27, 39, -41, 37, -34, 40, -36, 44, -45, 43, -39, 47, -49, 45, -42, 48

Offset: 1

Clark Kimberling, May 16 2015

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.

			a(1) = 0, d(1) = 2;
a(2) = 1, d(2) = 1;
a(3) = 4, d(3) = 3;
a(4) = 2, d(4) = -2.

Clark Kimberling, Table of n, a(n) for n = 1..1000

Cf. A257905, A257908.

{a, f} = {{0}, {2}}; 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 *)

cp's OEIS Frontend

A257883 Sequence (a(n)) generated by Algorithm (in Comments) with a(1) = 0 and d(1) = 0.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A257905 Sequence (a(n)) generated by Rule 3 (in Comments) with a(1) = 0 and d(1) = 0.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

Mathematica

Formula

A257909 Sequence (d(n)) generated by Rule 3 (in Comments) with a(1) = 0 and d(1) = 2.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica