A286299 First differences of A286298.

1, 2, -1, 2, 1, -1, -1, 2, 1, 1, -1, -1, 1, -1, -1, 2, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, -1, 1, -1, -1, 2, 1, 1, -1, 1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, -1, 1, -1, -1, 2, 1, 1

Offset

0,2

Comments

A014577 is obtained if sequence terms are changed as follows: 2's replaced by 1's and -1's replaced by 0's. - Karyn McLellan, Aug 16 2018

Links

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

Danielle Cox and K. McLellan, A problem on generation sets containing Fibonacci numbers, Fib. Quart., 55 (No. 2, 2017), 105-113.

Formula

a(n) = 2*A034947(n) if n = 2^k for k>1, otherwise a(n) = A034947(n). - Karyn McLellan, Aug 16 2018

Crossrefs

Cf. A286298.

Sequence in context: A106345 A319395 A194636 * A081729 A219157 A080215

Adjacent sequences: A286296 A286297 A286298 * A286300 A286301 A286302

Keyword

sign

Author

N. J. A. Sloane, Jun 02 2017

Status

approved