The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A259624 Strictly increasing list of F - 1, F, and F + 1, where F = A000045, the Fibonacci numbers. 3
 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 12, 13, 14, 20, 21, 22, 33, 34, 35, 54, 55, 56, 88, 89, 90, 143, 144, 145, 232, 233, 234, 376, 377, 378, 609, 610, 611, 986, 987, 988, 1596, 1597, 1598, 2583, 2584, 2585, 4180, 4181, 4182, 6764, 6765, 6766, 10945, 10946, 10947 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS Clark Kimberling, Table of n, a(n) for n = 1..2000 FORMULA G.f.: -((x (1 + x) (1 + x + x^2 + x^4) (1 + x + 2 x^2 + x^3 + x^4 + x^5))/((1 + x + x^2) (-1 + x^3 + x^6))). MATHEMATICA Union[# - 1, #, # + 1] &[Fibonacci[Range[50]]] CROSSREFS Cf. A000045, A258085, A259623. Sequence in context: A267762 A296861 A069784 * A178338 A048097 A130843 Adjacent sequences: A259621 A259622 A259623 * A259625 A259626 A259627 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified February 22 22:43 EST 2024. Contains 370265 sequences. (Running on oeis4.)