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!)
A295357 Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-1) + b(n-2) + b(n-3), where a(0) = 1, a(1) = 3, a(2) = 5, b(0) = 2, b(1) = 4, b(2) = 6, and (a(n)) and (b(n)) are increasing complementary sequences. 11

%I #5 Nov 21 2017 21:33:18

%S 1,3,5,20,42,83,149,259,438,730,1204,1973,3219,5237,8504,13792,22350,

%T 36200,58612,94878,153559,248509,402143,650730,1052954,1703768,

%U 2756809,4460667,7217569,11678332,18896000,30574434,49470539

%N Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-1) + b(n-2) + b(n-3), where a(0) = 1, a(1) = 3, a(2) = 5, b(0) = 2, b(1) = 4, b(2) = 6, 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. Guide to related sequences:

%C ***** Part 1: initial values are a(0) = 1, a(1) = 3, a(2) = 5, b(0) = 2, b(1) = 4, b(2) = 6

%C A295357: a(n) = a(n-1) + a(n-2) + b(n-1) + b(n-2) + b(n-3)

%C A295358: a(n) = a(n-1) + a(n-2) + b(n-1) + b(n-2) - b(n-3)

%C A295359: a(n) = a(n-1) + a(n-2) + b(n-1) + b(n-2) - 2*b(n-3)

%C A295360: a(n) = a(n-1) + a(n-2) + b(n-1) + b(n-2) - 3*b(n-3)

%C A295361: a(n) = a(n-1) + a(n-2) + b(n-1) + 2*b(n-2) - 3*b(n-3)

%C A295362: a(n) = a(n-1) + a(n-2) + b(n-1) - b(n-2) - b(n-3)

%C ***** Part 2: initial values as shown

%C A295363: a(n) = a(n-1) + a(n-2) + b(n-1)*b(n-2); a(0) = 1, a(1) = 3, b(0) = 2, b(1) = 4

%C A295364: a(n) = a(n-1) + a(n-2) + b(n-1)*b(n-2); a(0) = 1, a(1) = 3, a(2) = 5, b(0) = 2, b(1) = 4

%C A295365: a(n) = a(n-1) + a(n-2) + b(n-1) + b(n-2) + b(n-3); a(0) = 1, a(1) = 2, a(2) = 3, b(0) = 4, b(1) = 5, b(2) = 6

%C A295366: a(n) = a(n-1) + a(n-2) + b(n-1) + b(n-2) - b(n-3); a(0) = 1, a(1) = 2, a(2) = 3, b(0) = 4, b(1) = 5, b(2) = 6

%C A295367: a(n) = a(n-1) + a(n-2) + b(n-1)*b(n-2); a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4

%C For all of these sequences, a(n)/a(n-1) -> (1 + sqrt(5))/2 = golden ratio (A001622).

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

%e b(3) = 7 (least "new number")

%e a(3) = a(1) + a(0) + b(2) + b(1) + b(0) = 20

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

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

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

%t a[n_] := a[n] = a[n - 1] + a[n - 2] + 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 z = 32; u = Table[a[n], {n, 0, z}] (* A295357 *)

%t v = Table[b[n], {n, 0, 10}] (* complement *)

%Y Cf. A001622, A293076, A294532.

%K nonn,easy

%O 0,2

%A _Clark Kimberling_, Nov 21 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 25 05:18 EDT 2024. Contains 371964 sequences. (Running on oeis4.)