login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A294421 Solution of the complementary equation a(n) = a(n-1) + a(n-2) + 2*b(n-1) - b(n-2), where a(0) = 1, a(1) = 3, b(0) = 2, b(1) = 4. 2

%I #9 Nov 01 2017 20:54:38

%S 1,3,10,19,36,63,108,181,302,496,812,1323,2151,3491,5660,9170,14852,

%T 24044,38919,62987,101931,164944,266902,431874,698805,1130709,1829545,

%U 2960286,4789864,7750184,12540083,20290303,32830425,53120767,85951232,139072040

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

%C The complementary sequences a() and b() are uniquely determined by the titular equation and initial values. See A294414 for a guide to related sequences.

%C Conjecture: a(n)/a(n-1) -> (1 + sqrt(5))/2, the golden ratio.

%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) = 1, a(1) = 3, b(0) = 2, b(1) = 4, so that

%e a(2) = a(1) + a(0) + 2*b(1) - b(0) = 10

%e Complement: (b(n)) = (2, 4, 5, 6, 7, 8, 9, 11, 12, 13, ...)

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

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

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

%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, 40}] (* A294421 *)

%t Table[b[n], {n, 0, 10}]

%Y Cf. A293076, A293765, A294414.

%K nonn,easy

%O 0,2

%A _Clark Kimberling_, Oct 31 2017

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 03:33 EDT 2024. Contains 371767 sequences. (Running on oeis4.)