Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #5 Nov 19 2017 10:43:33
%S 3,4,7,9,13,17,24,31,45,59,86,114,168,223,331,441,657,877,1309,1748,
%T 2612,3490,5218,6974,10430,13941,20853,27875,41699,55743,83391,111479,
%U 166775,222951,333543,445895,667079,891783,1334150,1783558,2668292,3567108
%N Solution of the complementary equation a(n) = 2*a(n-2) - b(n-2) + n, where a(0) = 3, a(1) = 4, b(0) = 1, and (a(n)) and (b(n)) are increasing complementary sequences.
%C The increasing complementary sequences a() and b() are uniquely determined by the titular equation and initial values. See A295053 for a guide to related sequences.
%C The sequence a(n+1)/a(n) appears to have two convergent subsequences, with limits 1.33..., 1.49...
%H Clark Kimberling, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL10/Kimberling/kimberling26.html">Complementary equations</a>, J. Int. Seq. 19 (2007), 1-13.
%e a(0) = 3, a(1) = 4, b(0) = 1
%e a(2) = 2*a(0) - b(0) + 2 = 7
%e Complement: (b(n)) = (1, 2, 5, 6, 8, 10, 11, 12, 14, 15, 16, 18, ... )
%t mex := First[Complement[Range[1, Max[#1] + 1], #1]] &;
%t a[0] = 3; a[1] = 4; b[0] = 1;
%t a[n_] := a[n] = 2 a[n - 2] + b[n - 1] + n;
%t b[n_] := b[n] = mex[Flatten[Table[Join[{a[n]}, {a[i], b[i]}], {i, 0, n - 1}]]];
%t Table[a[n], {n, 0, 18}] (* A295069 *)
%t Table[b[n], {n, 0, 10}]
%Y Cf. A295053, A295068.
%K nonn,easy
%O 0,1
%A _Clark Kimberling_, Nov 19 2017