cp's OEIS Frontend

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.

%I A297834 #4 Feb 06 2018 19:27:48
%S A297834 1,2,5,8,12,17,19,22,27,29,32,35,40,44,46,51,53,56,59,64,68,70,75,77,
%T A297834 82,84,87,90,95,97,100,105,109,111,114,117,122,126,128,133,135,140,
%U A297834 142,145,148,153,155,158,163,167,169,172,175,180,184,186,189,192
%N 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.
%C A297834 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.
%C A297834 Conjecture: -3 < a(n) - (2 +sqrt(2))*n <= 1 for n >= 1.
%H A297834 Clark Kimberling, <a href="/A297834/b297834.txt">Table of n, a(n) for n = 0..10000</a>
%e A297834 a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, so that a(2) = 5.
%e A297834 Complement: (b(n)) = (3,4,6,7,9,10,11,13,14,15,16,18,20,...)
%t A297834 a[0] = 1; a[1] = 2; b[0] = 3; b[1] = 4;
%t A297834 a[n_] := a[n] = a[1]*b[n - 1] - a[0]*b[n - 2] + 2 n - 4;
%t A297834 j = 1; While[j < 100, k = a[j] - j - 1;
%t A297834  While[k < a[j + 1] - j + 1, b[k] = j + k + 2; k++]; j++]; k
%t A297834 Table[a[n], {n, 0, k}]  (* A297834 *)
%Y A297834 Cf. A297826, A297830.
%K A297834 nonn,easy
%O A297834 0,2
%A A297834 _Clark Kimberling_, Feb 04 2018