cp's OEIS Frontend

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.

Showing 1-1 of 1 results.

A255139 a(n) = n! - Fibonacci(n).

Original entry on oeis.org

1, 0, 1, 4, 21, 115, 712, 5027, 40299, 362846, 3628745, 39916711, 479001456, 6227020567, 87178290823, 1307674367390, 20922789887013, 355687428094403, 6402373705725416, 121645100408827819, 2432902008176633235, 51090942171709429054
Offset: 0

Views

Author

Ilya Gutkovskiy, Jul 03 2015

Keywords

Examples

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

Crossrefs

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

Programs

  • Maple
    A255139 := proc(n)
        n!-combinat[fibonacci](n) ;
    end proc: # R. J. Mathar, Jul 08 2015
  • Mathematica
    Table[n! - Fibonacci[n], {n, 0, 20}]
  • PARI
    vector(30, n, n--; n! - fibonacci(n)) \\ Michel Marcus, Jul 05 2015

Formula

a(n) = A000142(n) - A000045(n).
E.g.f.: 1/(1 - x) - 2*exp(x/2)*sinh(sqrt(5)*x/2)/sqrt(5). - Ilya Gutkovskiy, Dec 27 2016
Showing 1-1 of 1 results.