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-2 of 2 results.

A298881 a(0) = 0; for n>0, a(n) = 6*n!.

Original entry on oeis.org

0, 6, 12, 36, 144, 720, 4320, 30240, 241920, 2177280, 21772800, 239500800, 2874009600, 37362124800, 523069747200, 7846046208000, 125536739328000, 2134124568576000, 38414242234368000, 729870602452992000, 14597412049059840000, 306545653030256640000
Offset: 0

Views

Author

Vincenzo Librandi, Feb 13 2018

Keywords

Links

Crossrefs

Cf. A274266.
Cf. sequences of the type k*n!: A000142 (k=1), A052849 (k=2), A052560 (k=3), A052578 (k=4), A052648 (k=5), this sequence (k=6), A062098 (k=7), A159038 (k=8), A174183 (k=10).

Programs

  • GAP
    Concatenation([0], List([1..25], n -> 6*Factorial(n))); # Bruno Berselli, Feb 13 2018
  • Magma
    [n eq 0 select 0 else 6*Factorial(n): n in [0..25]];
  • Mathematica
    Join[{0}, 6 Range[25]!]
  • PARI
    a(n) = if (n, 6*n!, 0); \\ Michel Marcus, Feb 15 2018

Formula

E.g.f.: 6*x/(1-x).
a(n) = n*a(n-1) = 6*A000142(n) for n>0.

Extensions

Edited by Bruno Berselli, Feb 13 2018

A384494 Triangle read by rows: T(n, k) = (-1)^k*(k+1)*(n+1-k)!, n >= 0, k = 0..n.

Original entry on oeis.org

1, 2, -2, 6, -4, 3, 24, -12, 6, -4, 120, -48, 18, -8, 5, 720, -240, 72, -24, 10, -6, 5040, -1440, 360, -96, 30, -12, 7, 40320, -10080, 2160, -480, 120, -36, 14, -8, 362880, -80640, 15120, -2880, 600, -144, 42, -16, 9, 3628800, -725760, 120960, -20160, 3600, -720, 168, -48, 18, -10
Offset: 0

Views

Author

Wolfdieter Lang, May 31 2025

Keywords

Comments

This triangle, written as (infinite) square matrix MT with vanishing upper diagonals 0, together with the Riordan triangle A104698, written also as such a square matrix MR, appears in the double sum formula for the number of certain restricted permutations given in A086852(n), as diagonal sequence A086852(n+2) = (2*MR*MT^t)_{n,n}, for n >=0, where t indicates matrix transpositon.

Examples

			The triangle T begins:
  n\k        0        1       2       3     4     5   6   7  8    9 ...
  ---------------------------------------------------------------------
  0:         1
  1:         2       -2
  2:         6       -4       3
  3:        24      -12       6      -4
  4:       120      -48      18      -8     5
  5:       720     -240      72     -24    10    -6
  6:      5040    -1440     360     -96    30   -12   7
  7:     40320   -10080    2160    -480    12   -36  14  -8
  8:    362880   -80640   15120   -2880   600  -144  42 -16  9
  9:   3628800  -725760  120960  -20160  3600  -720 168 -48 18 -10
  ...

Crossrefs

Cf. A104698, A086852, A086852.
Column sequences: A000142(n+1), -A052849, A052560(n-1), -A052578(n-2), A052648(n-3), -A298881(n-4), A062098(n-5), -A159038(n-6), ...

Programs

  • Mathematica
    Table[(-1)^k * (k+1) * (n+1-k)!, {n, 0, 9}, {k, 0, n}] // Flatten (* Amiram Eldar, May 31 2025 *)

Formula

T(n, k) = (-1)^k*(k+1)*(n+1-k)!, for n >= 0 and k = 0, 1, ..., n.
O.g.f. of row polynomials P(n, y) := Sum_{k=0..n} T(n, k) y^k: G(x, y) = ((N(x) - 1)/x) * (1/(1 + y*x)^2), with N(x) = hypergeometric([1,1], [], x), the o.g.f. of {n!}_{n>=0} (see A000142).
Showing 1-2 of 2 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.