|
%I #23 Sep 08 2022 08:45:42
%S 2,3,3,4,5,7,10,15,23,36,57,91,146,235,379,612,989,1599,2586,4183,
%T 6767,10948,17713,28659,46370,75027,121395,196420,317813,514231,
%U 832042,1346271,2178311,3524580,5702889,9227467,14930354,24157819,39088171,63245988,102334157
%N a(n) = Fibonacci(n) + 2.
%C a(n) = A226649(2*n+1) - A226649(2*n). - _Reinhard Zumkeller_, Jul 30 2013
%H Vincenzo Librandi, <a href="/A157725/b157725.txt">Table of n, a(n) for n = 0..285</a>
%H K.-W. Chen, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL14/Chen/chen70.html">Greatest Common Divisors in Shifted Fibonacci Sequences</a>, J. Int. Seq. 14 (2011) # 11.4.7
%H Ivana Jovović and Branko Malešević, <a href="http://nntdm.net/volume-23-2017/number-1/28-38/">Some enumerations of non-trivial composition of the differential operations and the directional derivative</a>, Notes on Number Theory and Discrete Mathematics, Vol. 23, 2017, No. 1, 28-38.
%H <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (2,0,-1).
%F G.f.: -(1+x)*(3*x-2) / ( (x-1)*(x^2+x-1) ). - _R. J. Mathar_, Aug 08 2012
%F a(0) = 2, a(1) = 3, a(n) = a(n - 2) + a(n - 1) - 2. - _Reinhard Zumkeller_, Jul 30 2013
%o (Magma) [ Fibonacci(n) + 2: n in [0..40] ]; // _Vincenzo Librandi_, Apr 24 2011
%o (PARI) a(n)=fibonacci(n)+2 \\ _Charles R Greathouse IV_, Jul 02 2013
%o (Haskell)
%o a157725 = (+ 2) . a000045
%o a157725_list = 2 : 3 : map (subtract 2)
%o (zipWith (+) a157725_list $ tail a157725_list)
%o -- _Reinhard Zumkeller_, Jul 30 2013
%Y Cf. A000045, A001611, A000071, A157725, A001911, A157726, A006327, A157727, A157728, A157729, A167616.
%K nonn,easy
%O 0,1
%A _N. J. A. Sloane_, Jun 26 2010
|
