cp's OEIS Frontend

A298113 Solution b( ) of the complementary equation a(n) = a(1)*b(n) - a(0)*b(n-1) + 4*n, 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.

%I A298113 #8 Feb 11 2018 03:08:47
%S A298113 3,4,5,6,7,8,9,10,11,12,13,15,16,17,18,20,21,22,23,25,26,27,28,30,31,
%T A298113 32,33,35,36,37,38,40,41,42,43,45,46,47,48,50,51,52,53,55,56,57,58,59,
%U A298113 60,62,63,64,66,67,68,69,71,72,73,74,76,77,78,79,80,81
%N A298113 Solution b( ) of the complementary equation a(n) = a(1)*b(n) - a(0)*b(n-1) + 4*n, 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.
%C A298113 The increasing complementary sequences a() and b() are uniquely determined by the titular equation and initial values.  The solution a( ) is given at A298002.  See A297830 for a guide to related sequences.
%C A298113 Conjecture:  1/2 < a(n) - n*sqrt(2) < 3 for n >= 1.
%H A298113 Clark Kimberling, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL10/Kimberling/kimberling26.html">Complementary equations</a>, J. Int. Seq. 19 (2007), 1-13.
%t A298113 a[0] = 1; a[1] = 2; b[0] = 3; b[1] = 4; b[2] = 5;
%t A298113 a[n_] := a[n] = a[1]*b[n] - a[0]*b[n - 1] + 4 n;
%t A298113 j = 1; While[j < 80000, k = a[j] - j - 1;
%t A298113 While[k < a[j + 1] - j + 1, b[k] = j + k + 2; k++]; j++]; k
%t A298113 u = Table[a[n], {n, 0, k}]; (* A298002 *)
%t A298113 v = Table[b[n], {n, 0, k}]; (* A298113 *)
%t A298113 Take[u, 50]
%t A298113 Take[v, 50]
%Y A298113 Cf. A297830, A298002.
%K A298113 nonn,easy
%O A298113 0,1
%A A298113 _Clark Kimberling_, Feb 09 2018