|
%I #9 May 26 2018 22:47:31
%S 1,3,4,5,6,7,9,10,11,12,14,15,16,18,19,20,21,23,24,25,26,28,29,30,31,
%T 32,34,35,36,37,39,40,41,43,44,45,46,48,49,50,51,52,54,55,56,57,59,60,
%U 61,63,64,65,66,67,69,70,71,72,74,75,76,78,79,80,81,83
%N Solution (b(n)) of the complementary equation a(n) = b(n) + b(3n); see Comments.
%C Define complementary sequences a(n) and b(n) recursively:
%C b(n) = least new,
%C a(n) = b(n) + b(3n),
%C where "least new" means the least positive integer not yet placed. Empirically, {a(n) - 4*n: n >= 0} = {2,3} and {3*b(n) - 4*n: n >= 0} = {3,4,5,6,7}. See A304799 for a guide to related sequences.
%H Clark Kimberling, <a href="/A304802/b304802.txt">Table of n, a(n) for n = 0..10000</a>
%e b(0) = 1, so that a(0) = 2. Since a(1) = b(1) + b(3), we must have a(1) >= 8, so that b(1) = 3, b(2) = 4, b(3) = 5, b(4) = 6, b(5) = 7, and a(1) = 8.
%t mex[list_, start_] := (NestWhile[# + 1 &, start, MemberQ[list, #] &]);
%t h = 1; k = 3; a = {}; b = {1};
%t AppendTo[a, mex[Flatten[{a, b}], 1]];
%t Do[Do[AppendTo[b, mex[Flatten[{a, b}], Last[b]]], {k}];
%t AppendTo[a, Last[b] + b[[1 + (Length[b] - 1)/k h]]], {500}];
%t Take[a, 200] (* A304801 *)
%t Take[b, 200] (* A304802 *)
%t (* _Peter J. C. Moses_, May 14 2008 *)
%Y Cf. A304799, A304801.
%K nonn,easy
%O 0,2
%A _Clark Kimberling_, May 19 2018
|
