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!)
A259623 Strictly increasing list of F and F + 1, where F = A000045, the Fibonacci numbers. 5
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Clark Kimberling, Table of n, a(n) for n = 1..2000

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))).

MATHEMATICA

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

CROSSREFS

Cf. A000045, A258085.

Sequence in context: A084693 A276765 A121644 * A305734 A002242 A317676

Adjacent sequences:  A259620 A259621 A259622 * A259624 A259625 A259626

KEYWORD

nonn,easy

AUTHOR

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

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 April 15 02:27 EDT 2021. Contains 342974 sequences. (Running on oeis4.)