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

%I #4 Nov 19 2017 19:05:13

%S 1,2,6,10,23,37,77,120,242,372,739,1130,2232,3406,6713,10236,20158,

%T 30728,60495,92206,181509,276643,544553,829956,1633687,2489897,

%U 4901091,7469722,14703305,22409199,44109949,67227632,132329883

%N Solution of the complementary equation a(n) = 3*a(n-2) + b(n-2), where a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, 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. See A295053 for a guide to related sequences.

%C The sequence a(n+1)/a(n) appears to have two convergent subsequences, with limits 1.52..., 1.96...

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

%e a(2) =3*a(0) + b(0) = 6

%e Complement: (b(n)) = (3, 4, 5, 7, 8, 9, 11, 12, 13, 14, 15, ...)

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

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

%t a[n_] := a[n] = 3 a[n - 2] + 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, 18}] (* A295139 *)

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

%Y Cf. A295053.

%K nonn,easy

%O 0,2

%A _Clark Kimberling_, Nov 19 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 July 12 20:37 EDT 2024. Contains 374252 sequences. (Running on oeis4.)