login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A255139 a(n) = n! - Fibonacci(n). 1

%I #30 Dec 27 2016 23:21:17

%S 1,0,1,4,21,115,712,5027,40299,362846,3628745,39916711,479001456,

%T 6227020567,87178290823,1307674367390,20922789887013,355687428094403,

%U 6402373705725416,121645100408827819,2432902008176633235,51090942171709429054

%N a(n) = n! - Fibonacci(n).

%F a(n) = A000142(n) - A000045(n).

%F E.g.f.: 1/(1 - x) - 2*exp(x/2)*sinh(sqrt(5)*x/2)/sqrt(5). - _Ilya Gutkovskiy_, Dec 27 2016

%e For n = 0, a(0) = 0! - F(0) = 1 - 0 = 1.

%p A255139 := proc(n)

%p n!-combinat[fibonacci](n) ;

%p end proc: # _R. J. Mathar_, Jul 08 2015

%t Table[n! - Fibonacci[n], {n, 0, 20}]

%o (PARI) vector(30, n, n--; n! - fibonacci(n)) \\ _Michel Marcus_, Jul 05 2015

%Y Cf. A000142, A000045, A080568 (the sum instead of the difference).

%K nonn,easy

%O 0,4

%A _Ilya Gutkovskiy_, Jul 03 2015

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 11:13 EDT 2024. Contains 371905 sequences. (Running on oeis4.)