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!)
A294422 Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-1) - b(n-2) + 1, where a(0) = 1, a(1) = 3, b(0) = 2, b(1) = 4. 2

%I #5 Nov 01 2017 12:26:17

%S 1,3,7,12,21,36,59,97,158,258,418,678,1098,1778,2878,4658,7538,12199,

%T 19739,31940,51681,83623,135306,218931,354239,573172,927413,1500587,

%U 2428002,3928591,6356595,10285189,16641786,26926977,43568765,70495744

%N Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-1) - b(n-2) + 1, 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) + b(1) - b(0) + 1 = 7

%e Complement: (b(n)) = (2, 4, 5, 6, 8, 9, 11, 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] + b[n - 1] - b[n - 2] + 1;

%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}] (* A294422 *)

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

%Y Cf. A293076, A293765, A294414.

%K nonn,easy

%O 0,2

%A _Clark Kimberling_, Nov 01 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 September 14 18:34 EDT 2024. Contains 375929 sequences. (Running on oeis4.)