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.

A369119 a(n) = (n + 1)^[is_prime(n + 1)] * n!.

Original entry on oeis.org

1, 2, 6, 6, 120, 120, 5040, 5040, 40320, 362880, 39916800, 39916800, 6227020800, 6227020800, 87178291200, 1307674368000, 355687428096000, 355687428096000, 121645100408832000, 121645100408832000, 2432902008176640000, 51090942171709440000
Offset: 0

Views

Author

Peter Luschny, Jan 14 2024

Keywords

Crossrefs

Cf. A089026, A000142, A347425, A000367/A002445 (Bernoulli(2n)).

Programs

  • Mathematica
    A369119[n_] := n! If[PrimeQ[n+1], n+1, 1];
    Array[A369119, 25, 0] (* Paolo Xausa, Jan 15 2024 *)
  • SageMath
    def A369119(n): return (n+1)^is_prime(n+1)*factorial(n)

Formula

a(2*n)*Bernoulli(2*n) = A347425(n).
Showing 1-1 of 1 results.