A297830 -id:A297830 - cp's OEIS frontend

A297826 Solution (a(n)) of the near-complementary equation a(n) = a(1)b(n-1) - a(0)b(n-2) + n, where a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, and (b(n)) is the increasing sequence of positive integers not in (a(n)). See Comments.

1, 2, 7, 9, 11, 15, 18, 21, 22, 24, 28, 29, 33, 34, 40, 42, 43, 45, 51, 51, 53, 59, 59, 61, 63, 65, 69, 74, 76, 77, 79, 81, 83, 87, 90, 91, 93, 95, 97, 101, 104, 107, 110, 111, 113, 117, 118, 120, 122, 126, 131, 133, 136, 139, 140, 142, 146, 147, 153, 155

Offset: 0

Clark Kimberling, Feb 04 2018

The sequence (a(n)) generated by the equation a(n) = a(1)*b(n-1) - a(0)*b(n-2) + n, with initial values as shown, includes duplicates; e.g. a(18) = a(19) = 51.  If the duplicates are removed from (a(n)), the resulting sequence and (b(n)) are complementary. Conjectures:
(1) 0 <= a(k) - a(k-1) <= 6 for k>=1;
(2) if d is in {0,1,2,3,4,5,6}, then a(k) = a(k-1) + d for infinitely many k.
***
See A297830 for a guide to related sequences.

			a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, so that a(2) = 7.
Complement: (b(n)) = (3, 4, 5, 6, 8,10,12,13,14,16, ...)

Clark Kimberling, Table of n, a(n) for n = 0..10000

Cf. A297997, A297830.

mex[list_, start_] := (NestWhile[# + 1 &, start, MemberQ[list, #] &]);
tbl = {}; a[0] = 1; a[1] = 2; b[0] = 3; b[1] = 4;
a[n_] := a[n] = a[1]*b[n - 1] - a[0]*b[n - 2] + n;
b[n_] := b[n] = mex[tbl = Join[{a[n], a[n - 1], b[n - 1]}, tbl], b[n - 1]];
Table[a[n], {n, 0, 300}]  (* A297826 *)
Table[b[n], {n, 0, 300}]  (* A297997 *)
(* Peter J. C. Moses, Jan 03 2017 *)

A297836 Solution of the complementary equation a(n) = a(1)b(n-1) - a(0)b(n-2) + 3*n, where a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, and (b(n)) is the increasing sequence of positive integers not in (a(n)). See Comments.

Original entry on oeis.org

1, 2, 11, 15, 19, 23, 27, 31, 35, 41, 44, 48, 54, 57, 61, 67, 70, 74, 80, 83, 87, 93, 96, 100, 106, 109, 113, 119, 122, 126, 130, 134, 140, 143, 149, 152, 156, 162, 165, 169, 173, 177, 183, 186, 192, 195, 199, 205, 208, 212, 216, 220, 226, 229, 235, 238, 242

Offset: 0

Clark Kimberling, Feb 04 2018

The increasing complementary sequences a() and b() are uniquely determined by the titular equation and initial values. For a guide to related sequences, see A297830.

Conjectures: a(n) - (5 + sqrt(13))*n/2 < 2 for n >= 1.

			a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, so that a(2) = 11.
Complement: (b(n)) = (3,4,5,6,7,8,9,10,12,13,14,16,17,18,20,...)

Clark Kimberling, Table of n, a(n) for n = 0..10000

Cf. A297826, A297830, A297837.

a[0] = 1; a[1] = 2; b[0] = 3; b[1] = 4;
a[n_] := a[n] = a[1]*b[n - 1] - a[0]*b[n - 2] + 3 n;
j = 1; While[j < 100, k = a[j] - j - 1;
 While[k < a[j + 1] - j + 1, b[k] = j + k + 2; k++]; j++]; k
Table[a[n], {n, 0, k}]  (* A297836 *)

A297837 Solution of the complementary equation a(n) = a(1)b(n-1) - a(0)b(n-2) + 4*n, where a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, and (b(n)) is the increasing sequence of positive integers not in (a(n)). See Comments.

Original entry on oeis.org

1, 2, 13, 18, 23, 28, 33, 38, 43, 48, 53, 60, 64, 69, 74, 81, 85, 90, 95, 102, 106, 111, 116, 123, 127, 132, 137, 144, 148, 153, 158, 165, 169, 174, 179, 186, 190, 195, 200, 207, 211, 216, 221, 228, 232, 237, 242, 247, 252, 259, 263, 268, 275, 279, 284, 289

Offset: 0

Clark Kimberling, Feb 04 2018

The increasing complementary sequences a() and b() are uniquely determined by the titular equation and initial values. For a guide to related sequences, see A297830.

Conjecture: a(n) - (3 + sqrt(5))*n < 3 for n >= 1.

			a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, so that a(2) = 13.
Complement: (b(n)) = (3,4,5,6,7,8,9,10,11,12,14,15,16,17,19,20,...)

Clark Kimberling, Table of n, a(n) for n = 0..10000

Cf. A297826, A297830, A297836.

a[0] = 1; a[1] = 2; b[0] = 3; b[1] = 4;
a[n_] := a[n] = a[1]*b[n - 1] - a[0]*b[n - 2] + 4 n;
j = 1; While[j < 100, k = a[j] - j - 1;
 While[k < a[j + 1] - j + 1, b[k] = j + k + 2; k++]; j++]; k
Table[a[n], {n, 0, k}]  (* A297836 *)

A297997 Solution (b(n)) of the near-complementary equation a(n) = a(1)b(n-1) - a(0)b(n-2) + n, where a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, and (b(n)) is the increasing sequence of positive integers not in (a(n)). See Comments.

Original entry on oeis.org

3, 4, 5, 6, 8, 10, 12, 13, 14, 16, 17, 19, 20, 23, 25, 26, 27, 30, 31, 32, 35, 36, 37, 38, 39, 41, 44, 46, 47, 48, 49, 50, 52, 54, 55, 56, 57, 58, 60, 62, 64, 66, 67, 68, 70, 71, 72, 73, 75, 78, 80, 82, 84, 85, 86, 88, 89, 92, 94, 96, 98, 99, 100, 102, 103

Offset: 0

Clark Kimberling, Feb 04 2018

The sequence (a(n)) generated by the equation a(n) = a(1)*b(n-1) - a(0)*b(n-2) + n, with initial values as shown, includes duplicates; e.g. a(18) = a(19) = 51.  If the duplicates are removed from (a(n)), the resulting sequence and (b(n)) are complementary. Conjectures:
(1) 1 <= b(k) - b(k-1) <= 3 for k>=1;
(2) if d is in {1,2,3}, then b(k) = b(k-1) + d for infinitely many k.
***
See A297830 for a guide to related sequences.

			a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, so that a(2) = 7.
Complement: (b(n)) = (3, 4, 5, 6, 8,10,12,13,14,16, ...)

Clark Kimberling, Table of n, a(n) for n = 0..10000

Cf. A297997, A297830.

mex[list_, start_] := (NestWhile[# + 1 &, start, MemberQ[list, #] &]);
tbl = {}; a[0] = 1; a[1] = 2; b[0] = 3; b[1] = 4;
a[n_] := a[n] = a[1]*b[n - 1] - a[0]*b[n - 2] + n;
b[n_] := b[n] = mex[tbl = Join[{a[n], a[n - 1], b[n - 1]}, tbl], b[n - 1]];
Table[a[n], {n, 0, 300}]  (* A297826 *)
Table[b[n], {n, 0, 300}]  (* A297997 *)
(* Peter J. C. Moses, Jan 03 2017 *)

A297832 Solution of the complementary equation a(n) = a(1)b(n-1) - a(0)b(n-2) + 2*n - 2, where a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, and (b(n)) is the increasing sequence of positive integers not in (a(n)). See Comments.

Original entry on oeis.org

1, 2, 7, 10, 13, 18, 20, 25, 27, 32, 34, 37, 40, 45, 49, 51, 54, 57, 62, 66, 68, 71, 74, 79, 83, 85, 90, 92, 97, 99, 102, 105, 110, 112, 115, 120, 124, 126, 131, 133, 138, 140, 143, 146, 151, 153, 156, 161, 165, 167, 172, 174, 179, 181, 184, 187, 192, 194

Offset: 0

Clark Kimberling, Feb 04 2018

The increasing complementary sequences a() and b() are uniquely determined by the titular equation and initial values. See A297830 for a guide to related sequences.

a(n) - (2+sqrt(2))*n < 2 for n >= 1.

			a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, so that a(2) = 7.
Complement: (b(n)) = (3,4,5,7,8,10,12,13,15,17,18,19,...)

Clark Kimberling, Table of n, a(n) for n = 0..10000

Cf. A297826, A297830.

a[0] = 1; a[1] = 2; b[0] = 3; b[1] = 4;
a[n_] := a[n] = a[1]*b[n - 1] - a[0]*b[n - 2] + 2 n - 2;
j = 1; While[j < 100, k = a[j] - j - 1;
While[k < a[j + 1] - j + 1, b[k] = j + k + 2; k++]; j++]; k
Table[a[n], {n, 0, k}]  (* A297832 *)

A298295 Solution a( ) of the complementary equation a(n) = a(0)b(n) + a(1)b(n-1), where a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, b(2) = 5, and (b(n)) is the increasing sequence of positive integers not in (a(n)). See Comments.

Original entry on oeis.org

1, 2, 13, 16, 19, 22, 25, 28, 31, 34, 38, 43, 47, 52, 56, 61, 65, 70, 74, 79, 83, 88, 92, 97, 101, 106, 109, 113, 118, 121, 124, 128, 133, 136, 140, 145, 148, 151, 155, 160, 163, 167, 172, 175, 178, 182, 187, 190, 194, 199, 202, 205, 209, 214, 217, 221, 226

Offset: 0

Clark Kimberling, Feb 09 2018

The increasing complementary sequences a() and b() are uniquely determined by the titular equation and initial values.

			a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, b(2) = 5, so that a(2) = 13.
Complement: (3,4,5,6,7,8,9,10,11,12,14,15,17,...)

Clark Kimberling, Table of n, a(n) for n = 0..1000
Clark Kimberling, Complementary equations, J. Int. Seq. 19 (2007), 1-13.

Cf. A298296, A297830, A298000.

mex[list_, start_] := (NestWhile[# + 1 &, start, MemberQ[list, #] &]);
a[0] = 1; a[1] = 2; b[0] = 3; b[1] = 4; b[2] = 5;
a[n_] := a[0]*b[n] + a[1]*b[n - 1]
Table[{a[n],
   b[n + 1] = mex[Flatten[Map[{a[#], b[#]} &, Range[0, n]]], b[n - 0]]}, {n, 2, 1010}];
Table[a[n], {n, 0, 150}]  (* A298295 *)
Table[b[n], {n, 0, 150}]  (* A298296 *)
(* Peter J. C. Moses, Jan 16 2018 *)

A298296 Solution b( ) of the complementary equation a(n) = a(0)b(n) + a(1)b(n-1), where a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, b(2) = 5, and (b(n)) is the increasing sequence of positive integers not in (a(n)). See Comments.

Original entry on oeis.org

3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 15, 17, 18, 20, 21, 23, 24, 26, 27, 29, 30, 32, 33, 35, 36, 37, 39, 40, 41, 42, 44, 45, 46, 48, 49, 50, 51, 53, 54, 55, 57, 58, 59, 60, 62, 63, 64, 66, 67, 68, 69, 71, 72, 73, 75, 76, 77, 78, 80, 81, 82, 84, 85, 86, 87

Offset: 0

Clark Kimberling, Feb 09 2018

The increasing complementary sequences a() and b() are uniquely determined by the titular equation and initial values; b(n)-b(n-1) is in {1,2} for all n >= 1.

			a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, b(2) = 5, so that a(2) = 13.
Complement: (3,4,5,6,7,8,9,10,11,12,14,15,17,...) = (b(n)).

Clark Kimberling, Table of n, a(n) for n = 0..1000
Clark Kimberling, Complementary equations, J. Int. Seq. 19 (2007), 1-13.

Cf. A298295, A297830, A298000.

mex[list_, start_] := (NestWhile[# + 1 &, start, MemberQ[list, #] &]);
a[0] = 1; a[1] = 2; b[0] = 3; b[1] = 4; b[2] = 5;
a[n_] := a[0]*b[n] + a[1]*b[n - 1]
Table[{a[n], b[n + 1] = mex[Flatten[Map[{a[#], b[#]} &, Range[0, n]]], b[n - 0]]}, {n, 2, 1010}];
Table[a[n], {n, 0, 150}]  (* A298295 *)
Table[b[n], {n, 0, 150}]  (* A298296 *)
(* Peter J. C. Moses, Jan 16 2018 *)

A297831 Solution of the complementary equation a(n) = a(1)b(n-1) - a(0)b(n-2) + 2*n - 1, where a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, and (b(n)) is the increasing sequence of positive integers not in (a(n)). See Comments.

Original entry on oeis.org

1, 2, 8, 11, 14, 17, 22, 24, 29, 31, 36, 38, 43, 45, 48, 51, 56, 60, 62, 65, 68, 73, 77, 79, 82, 85, 90, 94, 96, 99, 102, 107, 111, 113, 118, 120, 125, 127, 130, 133, 138, 140, 143, 148, 152, 154, 159, 161, 166, 168, 171, 174, 179, 181, 184, 189, 193, 195

Offset: 0

Clark Kimberling, Feb 04 2018

The increasing complementary sequences a() and b() are uniquely determined by the titular equation and initial values. See A297830 for a guide to related sequences.

Conjecture: a(n) - (2 +sqrt(2))*n < 5/2 for n >= 1.

			a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, so that a(2) = 8.
Complement: (b(n)) = (3,4,5,6,7,9,10,12,13,15,16,18,19,...)

Clark Kimberling, Table of n, a(n) for n = 0..10000

Cf. A297826, A297830.

a[0] = 1; a[1] = 2; b[0] = 3; b[1] = 4;
a[n_] := a[n] = a[1]*b[n - 1] - a[0]*b[n - 2] + 2 n - 1;
j = 1; While[j < 100, k = a[j] - j - 1;
 While[k < a[j + 1] - j + 1, b[k] = j + k + 2; k++]; j++]; k
Table[a[n], {n, 0, k}]  (* A297831 *)

A297833 Solution of the complementary equation a(n) = a(1)b(n-1) - a(0)b(n-2) + 2*n - 3, where a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, and (b(n)) is the increasing sequence of positive integers not in (a(n)). See Comments.

Original entry on oeis.org

1, 2, 6, 9, 14, 16, 21, 23, 26, 29, 34, 38, 40, 43, 46, 51, 55, 57, 62, 64, 69, 71, 74, 77, 82, 84, 87, 92, 96, 98, 103, 105, 110, 112, 115, 118, 123, 125, 128, 133, 137, 139, 142, 145, 150, 154, 156, 159, 162, 167, 171, 173, 178, 180, 185, 187, 190, 193

Offset: 0

Clark Kimberling, Feb 04 2018

The increasing complementary sequences a() and b() are uniquely determined by the titular equation and initial values. See A297830 for a guide to related sequences.

Conjecture: -2 < a(n) - (2 +sqrt(2))*n <= 1 for n >= 1.

			a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, so that a(2) = 6.
Complement: (b(n)) = (3,4,5,7,8,10,12,13,15,17,18,19,...)

Clark Kimberling, Table of n, a(n) for n = 0..10000

Cf. A297826, A297830.

a[0] = 1; a[1] = 2; b[0] = 3; b[1] = 4;
a[n_] := a[n] = a[1]*b[n - 1] - a[0]*b[n - 2] + 2 n - 3;
j = 1; While[j < 100, k = a[j] - j - 1;
 While[k < a[j + 1] - j + 1, b[k] = j + k + 2; k++]; j++]; k
Table[a[n], {n, 0, k}]  (* A297833 *)

A297834 Solution of the complementary equation a(n) = a(1)b(n-1) - a(0)b(n-2) + 2*n - 4, where a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, and (b(n)) is the increasing sequence of positive integers not in (a(n)). See Comments.

Original entry on oeis.org

1, 2, 5, 8, 12, 17, 19, 22, 27, 29, 32, 35, 40, 44, 46, 51, 53, 56, 59, 64, 68, 70, 75, 77, 82, 84, 87, 90, 95, 97, 100, 105, 109, 111, 114, 117, 122, 126, 128, 133, 135, 140, 142, 145, 148, 153, 155, 158, 163, 167, 169, 172, 175, 180, 184, 186, 189, 192

Offset: 0

Clark Kimberling, Feb 04 2018

The increasing complementary sequences a() and b() are uniquely determined by the titular equation and initial values. See A297830 for a guide to related sequences.

Conjecture: -3 < a(n) - (2 +sqrt(2))*n <= 1 for n >= 1.

			a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, so that a(2) = 5.
Complement: (b(n)) = (3,4,6,7,9,10,11,13,14,15,16,18,20,...)

Clark Kimberling, Table of n, a(n) for n = 0..10000

Cf. A297826, A297830.

a[0] = 1; a[1] = 2; b[0] = 3; b[1] = 4;
a[n_] := a[n] = a[1]*b[n - 1] - a[0]*b[n - 2] + 2 n - 4;
j = 1; While[j < 100, k = a[j] - j - 1;
 While[k < a[j + 1] - j + 1, b[k] = j + k + 2; k++]; j++]; k
Table[a[n], {n, 0, k}]  (* A297834 *)

cp's OEIS Frontend

A297826 Solution (a(n)) of the near-complementary equation a(n) = a(1)*b(n-1) - a(0)*b(n-2) + n, where a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, and (b(n)) is the increasing sequence of positive integers not in (a(n)). See Comments.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A297836 Solution of the complementary equation a(n) = a(1)*b(n-1) - a(0)*b(n-2) + 3*n, where a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, and (b(n)) is the increasing sequence of positive integers not in (a(n)). See Comments.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A297837 Solution of the complementary equation a(n) = a(1)*b(n-1) - a(0)*b(n-2) + 4*n, where a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, and (b(n)) is the increasing sequence of positive integers not in (a(n)). See Comments.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A297997 Solution (b(n)) of the near-complementary equation a(n) = a(1)*b(n-1) - a(0)*b(n-2) + n, where a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, and (b(n)) is the increasing sequence of positive integers not in (a(n)). See Comments.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A297832 Solution of the complementary equation a(n) = a(1)*b(n-1) - a(0)*b(n-2) + 2*n - 2, where a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, and (b(n)) is the increasing sequence of positive integers not in (a(n)). See Comments.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A298295 Solution a( ) of the complementary equation a(n) = a(0)*b(n) + a(1)*b(n-1), where a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, b(2) = 5, and (b(n)) is the increasing sequence of positive integers not in (a(n)). See Comments.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A298296 Solution b( ) of the complementary equation a(n) = a(0)*b(n) + a(1)*b(n-1), where a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, b(2) = 5, and (b(n)) is the increasing sequence of positive integers not in (a(n)). See Comments.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A297831 Solution of the complementary equation a(n) = a(1)*b(n-1) - a(0)*b(n-2) + 2*n - 1, where a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, and (b(n)) is the increasing sequence of positive integers not in (a(n)). See Comments.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

A297826 Solution (a(n)) of the near-complementary equation a(n) = a(1)b(n-1) - a(0)b(n-2) + n, where a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, and (b(n)) is the increasing sequence of positive integers not in (a(n)). See Comments.

A297836 Solution of the complementary equation a(n) = a(1)b(n-1) - a(0)b(n-2) + 3*n, where a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, and (b(n)) is the increasing sequence of positive integers not in (a(n)). See Comments.

A297837 Solution of the complementary equation a(n) = a(1)b(n-1) - a(0)b(n-2) + 4*n, where a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, and (b(n)) is the increasing sequence of positive integers not in (a(n)). See Comments.

A297997 Solution (b(n)) of the near-complementary equation a(n) = a(1)b(n-1) - a(0)b(n-2) + n, where a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, and (b(n)) is the increasing sequence of positive integers not in (a(n)). See Comments.

A297832 Solution of the complementary equation a(n) = a(1)b(n-1) - a(0)b(n-2) + 2*n - 2, where a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, and (b(n)) is the increasing sequence of positive integers not in (a(n)). See Comments.

A298295 Solution a( ) of the complementary equation a(n) = a(0)b(n) + a(1)b(n-1), where a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, b(2) = 5, and (b(n)) is the increasing sequence of positive integers not in (a(n)). See Comments.

A298296 Solution b( ) of the complementary equation a(n) = a(0)b(n) + a(1)b(n-1), where a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, b(2) = 5, and (b(n)) is the increasing sequence of positive integers not in (a(n)). See Comments.

A297831 Solution of the complementary equation a(n) = a(1)b(n-1) - a(0)b(n-2) + 2*n - 1, where a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, and (b(n)) is the increasing sequence of positive integers not in (a(n)). See Comments.

A297833 Solution of the complementary equation a(n) = a(1)b(n-1) - a(0)b(n-2) + 2*n - 3, where a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, and (b(n)) is the increasing sequence of positive integers not in (a(n)). See Comments.

A297834 Solution of the complementary equation a(n) = a(1)b(n-1) - a(0)b(n-2) + 2*n - 4, where a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, and (b(n)) is the increasing sequence of positive integers not in (a(n)). See Comments.