A259623 Strictly increasing list of F and F + 1, where F = A000045, the Fibonacci numbers.

1, 2, 3, 4, 5, 6, 8, 9, 13, 14, 21, 22, 34, 35, 55, 56, 89, 90, 144, 145, 233, 234, 377, 378, 610, 611, 987, 988, 1597, 1598, 2584, 2585, 4181, 4182, 6765, 6766, 10946, 10947, 17711, 17712, 28657, 28658, 46368, 46369, 75025, 75026, 121393, 121394, 196418

Offset: 1

Author

Clark Kimberling and Peter J. C. Moses, Jul 01 2015

Keywords

• nonn
• easy

Links

• Clark Kimberling, Table of n, a(n) for n = 1..2000
• Index entries for linear recurrences with constant coefficients, signature (0, 2, 0, 0, 0, -1).

Crossrefs

Cf. A000045, A258085.

Programs

Mathematica

Union[#, # + 1] &[Fibonacci[Range[50]]]

Formula

G.f.: -((-1 - 2 x - x^2 + x^4 + 2 x^5 + x^6 + x^7)/((-1 + x) (1 + x) (-1 + x^2 + x^4))).