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 A081659 #50 Sep 08 2022 08:45:09
%S A081659 1,2,4,6,9,13,19,28,42,64,99,155,245,390,624,1002,1613,2601,4199,6784,
%T A081659 10966,17732,28679,46391,75049,121418,196444,317838,514257,832069,
%U A081659 1346299,2178340,3524610,5702920,9227499,14930387,24157853,39088206
%N A081659 a(n) = n + Fibonacci(n+1).
%C A081659 Row sums of triangle A135222. - _Gary W. Adamson_, Nov 23 2007
%C A081659 a(n) is the F(n+1)-th highest positive integer not equal to any a(k), 1 <= k <= n-1, where F(n) = Fibonacci numbers = A000045(n). - _Jaroslav Krizek_, Oct 28 2009
%H A081659 Vincenzo Librandi, <a href="/A081659/b081659.txt">Table of n, a(n) for n = 0..1000</a>
%H A081659 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (3,-2,-1,1).
%F A081659 a(n) = (sqrt(5)*(1+sqrt(5))^(n+1) - sqrt(5)*(1-sqrt(5))^(n+1))/(10*2^n) + n.
%F A081659 G.f.: (1-x-x^3)/((1-x-x^2)*(1-x)^2).
%F A081659 From _Jaroslav Krizek_, Oct 28 2009: (Start)
%F A081659 a(0) = 1, a(n) = a(n-1) + A000045(n-1) + 1 for n >= 1.
%F A081659 a(0) = 1, a(n) = a(n-1) + A000045(n+1) - A000045(n) + 1 for n >= 1.
%F A081659 a(0) = 1, a(1) = 2, a(2) = 4, a(n) = a(n-1) + a(n-2) - (n-3) n >= 3. (End)
%F A081659 E.g.f.: (1/10)*exp(-2*x/(1+sqrt(5)))*(5 - sqrt(5) + (5 + sqrt(5))*exp(sqrt(5)*x) + 10*exp((1/2)*(1+sqrt(5))*x)*x). - _Stefano Spezia_, Nov 20 2019
%p A081659 with(combinat); seq(n + fibonacci(n+1), n=0..40); # _G. C. Greubel_, Nov 20 2019
%t A081659 Table[ Fibonacci[n+1]+n, {n, 0, 38}] (* _Vladimir Joseph Stephan Orlovsky_, Apr 03 2011 *)
%t A081659 CoefficientList[Series[(x^3+x-1)/((x-1)^2 (x^2+x-1)), {x, 0, 40}], x] (* _Vincenzo Librandi_, Aug 10 2013 *)
%t A081659 LinearRecurrence[{3,-2,-1,1},{1,2,4,6},40] (* _Harvey P. Dale_, Mar 02 2016 *)
%o A081659 (MuPAD) numlib::fibonacci(n)+n-1 $ n = 1..48; // _Zerinvary Lajos_, May 08 2008
%o A081659 (Magma) [n+Fibonacci(n+1): n in [0..40]]; // _Vincenzo Librandi_, Aug 10 2013
%o A081659 (PARI) a(n)=n+fibonacci(n) \\ _Charles R Greathouse IV_, Oct 07 2015
%o A081659 (Sage) [n+fibonacci(n+1) for n in range(40)] # _G. C. Greubel_, Feb 12 2019
%o A081659 (GAP) List([0..40], n-> n + Fibonacci(n+1) ); # _G. C. Greubel_, Nov 20 2019
%Y A081659 Cf. A000045, A001611 (first differences), A002062, A135222.
%K A081659 nonn,easy
%O A081659 0,2
%A A081659 _Paul Barry_, Mar 26 2003