This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A259623 #9 Nov 22 2024 09:58:59 %S A259623 1,2,3,4,5,6,8,9,13,14,21,22,34,35,55,56,89,90,144,145,233,234,377, %T A259623 378,610,611,987,988,1597,1598,2584,2585,4181,4182,6765,6766,10946, %U A259623 10947,17711,17712,28657,28658,46368,46369,75025,75026,121393,121394,196418 %N A259623 Strictly increasing list of F and F + 1, where F = A000045, the Fibonacci numbers. %H A259623 Clark Kimberling, <a href="/A259623/b259623.txt">Table of n, a(n) for n = 1..2000</a> %H A259623 <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (0, 2, 0, 0, 0, -1). %F A259623 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 A259623 Union[#, # + 1] &[Fibonacci[Range[50]]] %Y A259623 Cf. A000045, A258085. %K A259623 nonn,easy %O A259623 1,2 %A A259623 _Clark Kimberling_ and _Peter J. C. Moses_, Jul 01 2015