A131389 -id:A131389 - cp's OEIS frontend

A131390 Conjectured permutation of the positive integers; inverse of conjectured permutation A131388.

1, 2, 4, 3, 8, 5, 10, 7, 16, 6, 9, 11, 24, 13, 28, 15, 32, 17, 12, 19, 21, 14, 44, 23, 46, 25, 27, 18, 56, 29, 20, 31, 22, 33, 68, 35, 72, 37, 39, 26, 90, 41, 88, 43, 92, 30, 45, 47, 94, 49, 51, 34, 108, 53, 36, 55, 59, 38, 57, 40, 61, 63, 42, 81, 65, 83, 67, 79, 69, 77, 71, 48

Offset: 1

Clark Kimberling, Jul 05 2007

nonn

Cf. A131388, A131389, A131391, A131392, A131393, A131394, A131395, A131396, A131397.

Inverse of A131388.

A131395 Conjectured permutation of the positive integers; inverse of conjectured permutation A131393.

Original entry on oeis.org

1, 2, 4, 3, 8, 5, 10, 7, 16, 6, 9, 11, 24, 13, 30, 15, 34, 17, 12, 19, 21, 14, 46, 23, 48, 25, 27, 18, 56, 29, 20, 31, 22, 33, 35, 77, 41, 37, 39, 26, 43, 28, 75, 45, 73, 71, 47, 32, 67, 49, 69, 51, 53, 36, 65, 55, 63, 38, 42, 40, 57, 59, 61, 44, 99, 97, 87, 93, 78, 91, 50, 89

Offset: 1

Clark Kimberling, Jul 05 2007

nonn

Cf. A131388, A131389, A131390, A131391, A131392, A131393, A131394, A131396, A131397.

Inverse of A131393.

A175499 a(n) = A175498(n+1)-A175498(n).

Original entry on oeis.org

1, 2, -1, 3, 4, -5, 6, -4, 5, -3, 7, -8, 9, -2, 8, -10, 11, -6, 10, -14, 12, -7, 13, -12, 14, -13, 15, -11, 16, -19, 17, -9, 18, -21, 19, -17, 20, -18, 21, -15, 22, -26, 23, -16, 24, -29, 25, -22, 27, -23, 26, -25, 28, -27, 29, -28, 30, -24, 31, -35, 32, 33, -62, 34, -31, 35, -34, 36, -33, 37, -39, 38, -32, 39, -42, 40, -36

Offset: 1

Leroy Quet, May 31 2010

sign

No integer occurs in this sequence more than once, by definition. Is this sequence a permutation of the nonzero integers?

Chai Wah Wu, Table of n, a(n) for n = 1..4999

Cf. A175498, A257884, A131389.

a175499 n = a175499_list !! (n-1)
a175499_list = zipWith (-) (tail a175498_list) a175498_list
-- Reinhard Zumkeller, Apr 25 2015

a[1] = 0; d[1] = 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]]
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}]  (* A257884 *)
Table[d[k], {k, 1, zz}] (* A175499 *)
(* Clark Kimberling, May 13 2015 *)

A175499_list, l, s, b = [1], 2, 3, set()
for n in range(2, 10**2):
    i, j = s, s-l
    while True:
        if not (i in b or j in A175499_list):
            A175499_list.append(j)
            b.add(i)
            l = i
            while s in b:
                b.remove(s)
                s += 1
            break
        i += 1
        j += 1 # Chai Wah Wu, Dec 15 2014

More terms from Sean A. Irvine, Jan 27 2011

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

Original entry on oeis.org

0, 2, 1, 4, 8, 6, 3, 9, 5, 10, 17, 12, 20, 14, 7, 16, 26, 18, 29, 19, 31, 22, 11, 24, 38, 25, 13, 28, 44, 30, 15, 32, 50, 34, 53, 36, 56, 37, 58, 40, 62, 42, 21, 45, 23, 46, 71, 48, 74, 49, 76, 52, 80, 54, 27, 57, 86, 55, 87, 59, 90, 61, 94, 64, 98, 66, 33

Offset: 1

Clark Kimberling, May 12 2015

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.

			a(1) = 0, d(1) = 1;
a(2) = 2, d(2) = 2;
a(3) = 1, d(3) = -1;
a(4) = 4, d(4) = 3;
(The sequence d differs from A131389 only in the first 13 terms.)

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

Cf. A131388, A257705, A081145, A257883, A175498.

a[1] = 0; d[1] = 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}]  (* A257706 *)
Table[d[k], {k, 1, zz}]  (* A131389 shifted *)

a(n+1) - a(n) = d(n+1) = A131389(n+1) for n >= 1.

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

Original entry on oeis.org

0, -1, 2, 1, 3, -2, 4, -3, 5, 6, -4, -5, 7, 8, -7, -6, 9, 10, -8, -9, 12, -10, 11, 13, -11, 14, -13, 15, -12, 16, -14, -15, 17, 18, -16, -17, 19, 20, -19, -18, 22, 21, -20, 23, -22, 24, -21, -23, 25, 26, -25, 27, -24, 28, -26, -27, 30, -28, 29, 31, -29, 32

Offset: 1

Clark Kimberling, May 13 2015

This is the sequence (d(n)) of differences associated with the sequence a = A257879.
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.

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

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

Cf. A131389, A257705, A081145, A257883, A175499.

a[1] = 2; 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]];
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}] (* A257879 *)
Table[d[k], {k, 1, zz}]     (* A257880 *)

d(k) = a(k) - a(k-1) for k >=2, where a(k) = A257877(k).

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

Original entry on oeis.org

2, 1, 3, 4, 7, 5, 9, 6, 11, 17, 13, 8, 15, 23, 16, 10, 19, 29, 21, 12, 24, 14, 25, 38, 27, 41, 28, 43, 31, 47, 33, 18, 35, 53, 37, 20, 39, 59, 40, 22, 44, 65, 45, 68, 46, 70, 49, 26, 51, 77, 52, 79, 55, 83, 57, 30, 60, 32, 61, 92, 63, 95, 64, 34, 67, 101, 69

Offset: 1

Clark Kimberling, May 12 2015

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.

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

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

Cf. A131388, A131389, A257705, A081145, A257883, A175498.

a[1] = 2; 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]];
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}]  (* A257879 *)
Table[d[k], {k, 1, zz}]  (* A257880 *)

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

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

Original entry on oeis.org

3, 1, 2, -1, 4, -2, 5, -4, 6, -3, 7, -5, 8, -6, 9, -7, 10, -8, -9, 12, 11, -10, 13, -11, 14, -13, 15, -12, 16, -14, -15, 18, 17, -16, 19, -17, 20, -19, -18, 22, 21, -20, 23, -22, 24, -21, 25, -23, 26, -25, 27, -24, 28, -26, -27, 30, -28, 29, 31, -29, 32, -31

Offset: 1

Clark Kimberling, May 12 2015

This is the sequence (d(n)) of differences associated with the sequence a = A257877.
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.

			a(1) = 0, d(1) = 3;
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. A131389, A257705, A081145, A257883, A175499.

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 *)

d(k) = a(k) - a(k-1) for k >= 2, where a(k) = A257877(k).

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

Original entry on oeis.org

2, -1, 3, 1, -2, 4, 5, -3, 6, -4, -5, 7, 8, -7, -6, 9, 10, -8, -9, 12, 11, -10, 13, -11, 14, -13, 15, -12, 16, -14, -15, 18, -16, 17, 19, -17, 20, -19, -18, 22, 21, -20, 23, -22, 24, -21, -23, 25, 26, -24, 27, -25, 28, -26, -27, 30, -28, 29, 31, -29, 32, -31

Offset: 1

Clark Kimberling, May 13 2015

This is the sequence (d(n)) of differences associated with the sequence a = A257882.
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.

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

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

Cf. A131389, A257705, A081145, A257918, A175499.

a[1] = 2; d[1] = 2; 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}]  (* A257882 *)
Table[d[k], {k, 1, zz}]      (* A257918 *)

d(k) = a(k) - a(k-1) for k >=2, where a(k) = A257882(k).

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

Original entry on oeis.org

0, 1, 4, 3, 7, 5, 2, 8, 13, 9, 16, 11, 19, 12, 6, 15, 25, 17, 28, 18, 30, 21, 10, 23, 37, 24, 39, 27, 43, 29, 14, 31, 49, 33, 52, 35, 55, 36, 57, 34, 56, 38, 61, 41, 20, 44, 22, 47, 73, 48, 75, 51, 79, 53, 26, 58, 87, 59, 89, 60, 91, 54, 88, 50, 83, 42, 77

Offset: 1

Clark Kimberling, May 12 2015

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.

			a(1) = 0, d(1) = 2;
a(2) = 1, d(2) = 1;
a(3) = 3, d(3) = 3;
a(4) = 4, d(4) = -1.
The first terms of (d(n)) are (2,1,3,-1,4,-2,-3,6,5,...), which differs from A131389 only in initial terms.

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

Cf. A131388, A257705, A081145, A257883, A175498.

a[1] = 0; d[1] = 2; 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}]  (* A257876 *)
Table[d[k], {k, 1, zz}]      (* A131389 essentially *)

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

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

Original entry on oeis.org

1, 3, 2, 5, 9, 7, 4, 10, 6, 11, 18, 13, 21, 15, 8, 17, 27, 19, 30, 20, 32, 23, 12, 25, 39, 26, 14, 29, 45, 31, 16, 33, 51, 35, 54, 37, 57, 38, 59, 41, 63, 43, 22, 46, 24, 47, 72, 49, 75, 50, 77, 53, 81, 55, 28, 58, 87, 56, 88, 60, 91, 62, 95, 65, 99, 67, 34

Offset: 1

Clark Kimberling, May 12 2015

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.
Considering the first 1000 elements of this sequence and A257705 it appears that this is the same as A257705 apart from an index shift. - R. J. Mathar, May 14 2015

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

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

Cf. A131388, A131389, A257705, A081145, A257883, A175498.

a[1] = 1; d[1] = 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}]  (* A257878 *)
Table[d[k], {k, 1, zz}]      (* A131389 essentially *)

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

cp's OEIS Frontend

A131390 Conjectured permutation of the positive integers; inverse of conjectured permutation A131388.

Views

Author

Keywords

Crossrefs

Formula

A131395 Conjectured permutation of the positive integers; inverse of conjectured permutation A131393.

Views

Author

Keywords

Crossrefs

Formula

A175499 a(n) = A175498(n+1)-A175498(n).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

Mathematica

Python

Extensions

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

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

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

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

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

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

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

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

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

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula