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

%I #7 Nov 02 2017 09:19:24

%S 1,3,9,19,36,64,110,185,308,507,830,1353,2200,3571,5790,9381,15192,

%T 24596,39812,64433,104271,168731,273030,441790,714850,1156671,1871553,

%U 3028257,4899844,7928136,12828016,20756189,33584243,54340472,87924756,142265270

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

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

%e a(0) = 1, a(1) = 3, b(0) = 2, b(1) = 4, so that

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

%e a(3) = a(2) + a(1) + b(1) + 1 = 19.

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

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

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

%Y Cf. A001622 (golden ratio), A293076.

%K nonn,easy

%O 0,2

%A _Clark Kimberling_, Oct 28 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 01:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)