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.

A054119 a(n) = n! + (n-1)! + (n-2)!.

Original entry on oeis.org

1, 2, 4, 9, 32, 150, 864, 5880, 46080, 408240, 4032000, 43908480, 522547200, 6745939200, 93884313600, 1401079680000, 22317642547200, 377917892352000, 6778983923712000, 128403161542656000, 2560949482291200000, 53645489280294912000, 1177524571957493760000, 27027108408834293760000
Offset: 0

Views

Author

Keywords

Comments

In factorial base representation (A007623) the terms are written as: 1, 10, 20, 111, 1110, 11100, 111000, ... From a(3) = 9 = "111" onward each term begins always with three consecutive 1's, followed by n-3 zeros. - Antti Karttunen, Sep 24 2016

Crossrefs

Equals T(n, 3), array T as in A054115.
Row 6 of A276955 (from a(3)=9 onward).

Programs

Formula

For n>2, a(n) = (n-2)! * n^2. [Gary Detlefs, Aug 01 2009]
a(n) = (n+1)!*(H(n-1)+H(n+1)-H(n-2)-H(n))/2, n>1, where H(n) is the n-th harmonic number. [Gary Detlefs, Oct 04 2011]
E.g.f.: x + 1/(1-x) - x*log(1-x) = x^2/G(0)/2 where G(k) = 1 + (k+2)/(x - x*(k+1)/(x + k + 1 - x^4/(x^3 +(k+2)*(k+3)/G(k+1)))); (continued fraction, 3rd kind, 4-step). - Sergei N. Gladkovskii, Jul 06 2012
G.f.: G(0) where G(k) = 1 - x/(1 + x/(1 - x - (k+1)/( k+1 - x/Q))); (continued fraction, 3rd kind, 4-step). - Sergei N. Gladkovskii, Jul 28 2012
For n >= 1, a(n) = A276940(n)/n. - Antti Karttunen, Sep 24 2016
Sum_{n>=2} 1/a(n) = A306770. - Amiram Eldar, Nov 19 2020

Extensions

Simpler definition from Miklos Kristof, Jun 16 2005
More terms from Antti Karttunen, Sep 24 2016
Showing 1-1 of 1 results.