login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A299493 Solution b( ) of the complementary equation a(n) = b(n-1) + b(n-2) + b(n-3), where a(0) = 1, a(1) = 4, a(2) = 5; see Comments. 3

%I

%S 1,3,6,7,8,9,11,12,13,14,15,17,18,19,20,22,23,25,26,27,29,30,31,33,34,

%T 35,37,38,40,41,43,44,45,47,48,49,51,52,53,55,56,58,59,60,62,63,64,66,

%U 67,68,69,71,72,73,75,76,77,79,80,81,83,84,85,87,88,89

%N Solution b( ) of the complementary equation a(n) = b(n-1) + b(n-2) + b(n-3), where a(0) = 1, a(1) = 4, a(2) = 5; see Comments.

%C From the Bode-Harborth-Kimberling link:

%C a(n) = b(n-1) + b(n-2) + b(n-3) for n > 2;

%C b(0) = least positive integer not in {a(0),a(1),a(2)};

%C b(n) = least positive integer not in {a(0),...,a(n),b(0),...,b(n-1)} for n > 1.

%C Note that (b(n)) is strictly increasing and is the complement of (a(n)).

%C See A022424 for a guide to related sequences.

%H J-P. Bode, H. Harborth, C. Kimberling, <a href="https://www.fq.math.ca/Papers1/45-3/bode.pdf">Complementary Fibonacci sequences</a>, Fibonacci Quarterly 45 (2007), 254-264.

%t mex := First[Complement[Range[1, Max[#1] + 1], #1]] &;

%t a[0] = 2; a[1] = 4; a[2] = 5; b[0] = 1; b[1] = 3; b[2] = 6;

%t a[n_] := a[n] = b[n - 1] + b[n - 2] + b[n - 3];

%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, 100}] (* A299492 *)

%t Table[b[n], {n, 0, 100}] (* A299493 *)

%Y Cf. A022424, A299492.

%K nonn,easy

%O 0,2

%A _Clark Kimberling_, Feb 20 2018

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 24 00:38 EDT 2019. Contains 323528 sequences. (Running on oeis4.)