This site is supported by donations to The OEIS Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A297964 a(n) = A296220(n) - 4n. 2
 1, -2, 2, 1, 0, -1, -2, -3, -3, -2, -2, -1, -1, 0, 0, 1, 1, 2, 2, 3, 2, 2, 3, 2, 1, 1, 2, 1, 1, 2, 1, 0, 0, 1, 0, 0, 1, 0, -1, -1, 0, -1, -1, 0, -1, -2, -2, -1, -2, -2, -1, -2, -3, -3, -2, -3, -3, -2, -3, -4, -4, -3, -3, -2, -3, -3, -2, -3, -4, -4, -3, -3 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS It has been checked that -9 <= a(n) <= 8 for n=1..6*10^6. Conjectures: every integer appears infinitely many times, and -2 < a(n) - a(n-1) < 2 for n > 2. LINKS Clark Kimberling, Table of n, a(n) for n = 0..10000 MATHEMATICA a[0] = 1; a[1] = 2; b[0] = 3; b[1] = 4; a[n_] := a[n] = a[0]*b[n - 1] + a[1]*b[n - 2]; j = 1; While[j < 20000, k = a[j] - j - 1; While[k < a[j + 1] - j + 1, b[k] = j + k + 2; k++]; j++]; Table[a[n], {n, 0, k}]; (* A296220 *) Take[Table[a[n] - 4 n, {n, 0, k}], 300] (* A297964 *) CROSSREFS Cf. A296220. Sequence in context: A053188 A109389 A098884 * A296239 A039800 A251418 Adjacent sequences:  A297961 A297962 A297963 * A297965 A297966 A297967 KEYWORD sign,easy AUTHOR Clark Kimberling, Jan 10 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.

Last modified January 17 00:44 EST 2019. Contains 319206 sequences. (Running on oeis4.)