A114185 a(n) = Fibonacci(2*n) - n - 1.

0, 4, 16, 49, 137, 369, 978, 2574, 6754, 17699, 46355, 121379, 317796, 832024, 2178292, 5702869, 14930333, 39088149, 102334134, 267914274, 701408710, 1836311879, 4807526951, 12586268999, 32951280072, 86267571244, 225851433688, 591286729849, 1548008755889

Offset: 2

Author

Greg Huber, Feb 04 2006

Keywords

• easy
• nonn

Comments

Related to the log base phi of sequence A090162.

Links

• Vincenzo Librandi, Table of n, a(n) for n = 2..1000
• Guo-Niu Han, Enumeration of Standard Puzzles, 2011. [Cached copy]
• Guo-Niu Han, Enumeration of Standard Puzzles, arXiv:2006.14070 [math.CO], 2020.

Crossrefs

Cf. A001906, A090162.

Programs

Magma

[Fibonacci(2*n)-n-1: n in [2..40]]; // Vincenzo Librandi, Sep 03 2017

Maple

g:=(-1+3*z)/(1-3*z+z^2): gser:=series(g, z=0, 43): seq(abs(coeff(gser, z, n)-n), n=3..20); # Zerinvary Lajos, Mar 22 2009

Mathematica

Rest[Table[Fibonacci[2 n] - n - 1, {n, 30}]] (* Vincenzo Librandi, Sep 03 2017 *)

Extensions

More terms from Vincenzo Librandi, Sep 03 2017