Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #9 Nov 22 2024 09:58:59
%S 1,2,3,4,5,6,8,9,13,14,21,22,34,35,55,56,89,90,144,145,233,234,377,
%T 378,610,611,987,988,1597,1598,2584,2585,4181,4182,6765,6766,10946,
%U 10947,17711,17712,28657,28658,46368,46369,75025,75026,121393,121394,196418
%N Strictly increasing list of F and F + 1, where F = A000045, the Fibonacci numbers.
%H Clark Kimberling, <a href="/A259623/b259623.txt">Table of n, a(n) for n = 1..2000</a>
%H <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (0, 2, 0, 0, 0, -1).
%F 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))).
%t Union[#, # + 1] &[Fibonacci[Range[50]]]
%Y Cf. A000045, A258085.
%K nonn,easy
%O 1,2
%A _Clark Kimberling_ and _Peter J. C. Moses_, Jul 01 2015