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!)
A297831 Solution of the complementary equation a(n) = a(1)*b(n-1) - a(0)*b(n-2) + 2*n - 1, where a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, and (b(n)) is the increasing sequence of positive integers not in (a(n)). See Comments. 3

%I #4 Feb 06 2018 19:27:27

%S 1,2,8,11,14,17,22,24,29,31,36,38,43,45,48,51,56,60,62,65,68,73,77,79,

%T 82,85,90,94,96,99,102,107,111,113,118,120,125,127,130,133,138,140,

%U 143,148,152,154,159,161,166,168,171,174,179,181,184,189,193,195

%N Solution of the complementary equation a(n) = a(1)*b(n-1) - a(0)*b(n-2) + 2*n - 1, where a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, and (b(n)) is the increasing sequence of positive integers not in (a(n)). See Comments.

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

%C Conjecture: a(n) - (2 +sqrt(2))*n < 5/2 for n >= 1.

%H Clark Kimberling, <a href="/A297831/b297831.txt">Table of n, a(n) for n = 0..10000</a>

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

%e Complement: (b(n)) = (3,4,5,6,7,9,10,12,13,15,16,18,19,...)

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

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

%t j = 1; While[j < 100, k = a[j] - j - 1;

%t While[k < a[j + 1] - j + 1, b[k] = j + k + 2; k++]; j++]; k

%t Table[a[n], {n, 0, k}] (* A297831 *)

%Y Cf. A297826, A297830.

%K nonn,easy

%O 0,2

%A _Clark Kimberling_, Feb 04 2018

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 March 28 07:46 EDT 2024. Contains 371235 sequences. (Running on oeis4.)