login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A298007 Solution b( ) of the complementary equation a(n) = a(1)*b(n-1) - a(0)*b(n-2) + 2*n - 2, 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. 2
3, 4, 5, 6, 8, 9, 11, 12, 14, 15, 16, 17, 19, 21, 22, 23, 24, 26, 28, 29, 30, 31, 33, 35, 36, 38, 39, 41, 42, 43, 44, 46, 47, 48, 50, 52, 53, 55, 56, 58, 59, 60, 61, 63, 64, 65, 67, 69, 70, 72, 73, 75, 76, 77, 78, 80, 81, 82, 84, 86, 87, 88, 89, 91, 93, 94 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

The increasing complementary sequences a() and b() are uniquely determined by the titular equation and initial values.  The solution a( ) is given at A297832.  See A297830 for a guide to related sequences.

Conjecture:  1 < a(n) - n*sqrt(2) < 3 for n >= 1.

LINKS

Table of n, a(n) for n=0..65.

Clark Kimberling, Complementary equations, J. Int. Seq. 19 (2007), 1-13.

MATHEMATICA

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

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

j = 1; While[j < 80000, k = a[j] - j - 1;

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

u = Table[a[n], {n, 0, k}]; (* A297832 *)

v = Table[b[n], {n, 0, k}]; (* A298007 *)

Take[u, 50]

Take[v, 50]

CROSSREFS

Cf. A297830, A297832.

Sequence in context: A039066 A304800 A197911 * A026363 A124678 A026460

Adjacent sequences:  A298004 A298005 A298006 * A298008 A298009 A298010

KEYWORD

nonn,easy

AUTHOR

Clark Kimberling, Feb 09 2018

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 25 09:45 EDT 2021. Contains 345453 sequences. (Running on oeis4.)